./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 c9c8a757 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-c9c8a75 [2019-11-28 10:03:35,118 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 10:03:35,123 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 10:03:35,138 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 10:03:35,139 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 10:03:35,141 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 10:03:35,143 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 10:03:35,152 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 10:03:35,155 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 10:03:35,158 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 10:03:35,159 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 10:03:35,161 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 10:03:35,161 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 10:03:35,165 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 10:03:35,167 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 10:03:35,169 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 10:03:35,170 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 10:03:35,172 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 10:03:35,175 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 10:03:35,179 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 10:03:35,183 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 10:03:35,185 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 10:03:35,187 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 10:03:35,189 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 10:03:35,192 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 10:03:35,192 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 10:03:35,192 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 10:03:35,194 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 10:03:35,194 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 10:03:35,195 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 10:03:35,196 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 10:03:35,196 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 10:03:35,197 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 10:03:35,198 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 10:03:35,200 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 10:03:35,200 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 10:03:35,201 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 10:03:35,201 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 10:03:35,201 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 10:03:35,203 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 10:03:35,205 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 10:03:35,206 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-28 10:03:35,234 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 10:03:35,235 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 10:03:35,236 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 10:03:35,237 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 10:03:35,237 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 10:03:35,237 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 10:03:35,237 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 10:03:35,238 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 10:03:35,238 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 10:03:35,238 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 10:03:35,239 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 10:03:35,240 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 10:03:35,240 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 10:03:35,240 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 10:03:35,241 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 10:03:35,241 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 10:03:35,241 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 10:03:35,241 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 10:03:35,242 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 10:03:35,242 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 10:03:35,242 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 10:03:35,243 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 10:03:35,243 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 10:03:35,243 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 10:03:35,243 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 10:03:35,244 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 10:03:35,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 10:03:35,244 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 10:03:35,540 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 10:03:35,553 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 10:03:35,556 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 10:03:35,558 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 10:03:35,558 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 10:03:35,559 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 10:03:35,616 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d8efbc2c/a153c1fe89ec4d00b4e81a9e8cf71022/FLAG3ed480127 [2019-11-28 10:03:36,162 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 10:03:36,163 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i [2019-11-28 10:03:36,177 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d8efbc2c/a153c1fe89ec4d00b4e81a9e8cf71022/FLAG3ed480127 [2019-11-28 10:03:36,432 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d8efbc2c/a153c1fe89ec4d00b4e81a9e8cf71022 [2019-11-28 10:03:36,435 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 10:03:36,437 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 10:03:36,438 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 10:03:36,438 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 10:03:36,441 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 10:03:36,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:03:36" (1/1) ... [2019-11-28 10:03:36,445 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57813208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:03:36, skipping insertion in model container [2019-11-28 10:03:36,445 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:03:36" (1/1) ... [2019-11-28 10:03:36,452 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 10:03:36,503 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 10:03:36,974 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 10:03:37,001 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 10:03:37,002 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5bc5045f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:03:37, skipping insertion in model container [2019-11-28 10:03:37,003 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 10:03:37,004 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-11-28 10:03:37,007 INFO L168 Benchmark]: Toolchain (without parser) took 568.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -165.2 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-28 10:03:37,009 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 10:03:37,011 INFO L168 Benchmark]: CACSL2BoogieTranslator took 565.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -165.2 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-28 10:03:37,015 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 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 565.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -165.2 MB). Peak memory consumption was 26.0 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-c9c8a75 [2019-11-28 10:03:38,678 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 10:03:38,680 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 10:03:38,692 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 10:03:38,693 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 10:03:38,694 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 10:03:38,695 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 10:03:38,697 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 10:03:38,699 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 10:03:38,700 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 10:03:38,701 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 10:03:38,702 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 10:03:38,702 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 10:03:38,703 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 10:03:38,704 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 10:03:38,706 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 10:03:38,707 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 10:03:38,708 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 10:03:38,711 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 10:03:38,713 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 10:03:38,719 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 10:03:38,721 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 10:03:38,724 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 10:03:38,725 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 10:03:38,730 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 10:03:38,730 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 10:03:38,731 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 10:03:38,732 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 10:03:38,733 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 10:03:38,735 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 10:03:38,735 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 10:03:38,736 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 10:03:38,736 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 10:03:38,737 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 10:03:38,739 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 10:03:38,739 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 10:03:38,740 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 10:03:38,741 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 10:03:38,741 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 10:03:38,744 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 10:03:38,746 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 10:03:38,746 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-28 10:03:38,766 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 10:03:38,767 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 10:03:38,768 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 10:03:38,768 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 10:03:38,769 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 10:03:38,769 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 10:03:38,769 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 10:03:38,770 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 10:03:38,770 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 10:03:38,770 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 10:03:38,771 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 10:03:38,771 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 10:03:38,772 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 10:03:38,772 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 10:03:38,772 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 10:03:38,773 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 10:03:38,773 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-28 10:03:38,773 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-28 10:03:38,773 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 10:03:38,774 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 10:03:38,774 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 10:03:38,774 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 10:03:38,774 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 10:03:38,775 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 10:03:38,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 10:03:38,775 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 10:03:38,776 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 10:03:38,776 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-28 10:03:38,776 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-28 10:03:38,776 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-28 10:03:38,777 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 10:03:39,073 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 10:03:39,086 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 10:03:39,090 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 10:03:39,091 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 10:03:39,092 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 10:03:39,092 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 10:03:39,148 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b19eaa85e/f01713d6fb124613a8ed8166cec06443/FLAGbe3af46b9 [2019-11-28 10:03:39,667 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 10:03:39,667 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i [2019-11-28 10:03:39,682 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b19eaa85e/f01713d6fb124613a8ed8166cec06443/FLAGbe3af46b9 [2019-11-28 10:03:39,955 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b19eaa85e/f01713d6fb124613a8ed8166cec06443 [2019-11-28 10:03:39,958 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 10:03:39,960 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 10:03:39,961 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 10:03:39,961 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 10:03:39,964 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 10:03:39,965 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:03:39" (1/1) ... [2019-11-28 10:03:39,968 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c6d29e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:03:39, skipping insertion in model container [2019-11-28 10:03:39,969 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:03:39" (1/1) ... [2019-11-28 10:03:39,976 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 10:03:40,028 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 10:03:40,507 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 10:03:40,527 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-28 10:03:40,546 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 10:03:40,616 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 10:03:40,629 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 10:03:40,677 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 10:03:40,778 INFO L208 MainTranslator]: Completed translation [2019-11-28 10:03:40,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:03:40 WrapperNode [2019-11-28 10:03:40,780 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 10:03:40,781 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 10:03:40,782 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 10:03:40,782 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 10:03:40,792 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:03:40" (1/1) ... [2019-11-28 10:03:40,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:03:40" (1/1) ... [2019-11-28 10:03:40,830 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:03:40" (1/1) ... [2019-11-28 10:03:40,831 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:03:40" (1/1) ... [2019-11-28 10:03:40,878 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:03:40" (1/1) ... [2019-11-28 10:03:40,887 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:03:40" (1/1) ... [2019-11-28 10:03:40,897 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:03:40" (1/1) ... [2019-11-28 10:03:40,908 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 10:03:40,909 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 10:03:40,909 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 10:03:40,909 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 10:03:40,911 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:03:40" (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 10:03:40,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 10:03:40,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 10:03:40,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-28 10:03:40,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-28 10:03:40,970 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-28 10:03:40,970 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-28 10:03:40,971 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-28 10:03:40,971 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-28 10:03:40,971 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-28 10:03:40,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-28 10:03:40,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-28 10:03:40,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-28 10:03:40,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-28 10:03:40,972 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-28 10:03:40,972 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-28 10:03:40,973 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-28 10:03:40,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-28 10:03:40,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-28 10:03:40,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-28 10:03:40,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-28 10:03:40,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-28 10:03:40,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-28 10:03:40,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-28 10:03:40,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-28 10:03:40,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-28 10:03:40,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-28 10:03:40,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-28 10:03:40,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-28 10:03:40,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-28 10:03:40,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-28 10:03:40,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-28 10:03:40,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-28 10:03:40,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-28 10:03:40,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-28 10:03:40,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-28 10:03:40,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-28 10:03:40,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-28 10:03:40,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-28 10:03:40,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-28 10:03:40,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-28 10:03:40,978 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-28 10:03:40,978 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-28 10:03:40,978 INFO L138 BoogieDeclarations]: Found implementation of procedure f_22_get [2019-11-28 10:03:40,978 INFO L138 BoogieDeclarations]: Found implementation of procedure f_22_put [2019-11-28 10:03:40,979 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-28 10:03:40,979 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 10:03:40,979 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-28 10:03:40,979 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-28 10:03:40,980 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-28 10:03:40,980 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-28 10:03:40,980 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-28 10:03:40,980 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-28 10:03:40,980 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-28 10:03:40,981 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-28 10:03:40,981 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-28 10:03:40,981 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-28 10:03:40,981 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-28 10:03:40,982 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-28 10:03:40,982 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-28 10:03:40,982 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-28 10:03:40,982 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-28 10:03:40,982 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-28 10:03:40,983 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-28 10:03:40,983 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-28 10:03:40,983 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-28 10:03:40,983 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-28 10:03:40,983 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-28 10:03:40,984 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-28 10:03:40,984 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-28 10:03:40,984 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-28 10:03:40,984 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-28 10:03:40,984 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-28 10:03:40,985 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-28 10:03:40,985 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-28 10:03:40,985 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-28 10:03:40,985 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-28 10:03:40,986 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-28 10:03:40,986 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-28 10:03:40,986 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-28 10:03:40,986 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-28 10:03:40,986 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-28 10:03:40,986 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-28 10:03:40,987 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-28 10:03:40,987 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-28 10:03:40,987 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-28 10:03:40,987 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-28 10:03:40,988 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-28 10:03:40,988 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-28 10:03:40,988 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-28 10:03:40,988 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-28 10:03:40,988 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-28 10:03:40,989 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-28 10:03:40,989 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-28 10:03:40,989 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-28 10:03:40,989 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-28 10:03:40,989 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-28 10:03:40,989 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-28 10:03:40,990 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-28 10:03:40,990 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-28 10:03:40,990 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-28 10:03:40,990 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-28 10:03:40,990 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-28 10:03:40,991 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-28 10:03:40,991 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-28 10:03:40,991 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-28 10:03:40,991 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 10:03:40,991 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-28 10:03:40,992 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 10:03:40,992 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-28 10:03:40,992 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-28 10:03:40,992 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-28 10:03:40,992 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-28 10:03:40,993 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-28 10:03:40,993 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-28 10:03:40,993 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-28 10:03:40,993 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-28 10:03:40,993 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-28 10:03:40,994 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-28 10:03:40,994 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-28 10:03:40,994 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-28 10:03:40,994 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-28 10:03:40,994 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-28 10:03:40,995 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-28 10:03:40,995 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-28 10:03:40,995 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-28 10:03:40,995 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-28 10:03:40,995 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-28 10:03:40,996 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-28 10:03:40,996 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-28 10:03:40,996 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-28 10:03:40,996 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-28 10:03:40,996 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-28 10:03:40,997 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-28 10:03:40,997 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-28 10:03:40,997 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-28 10:03:40,997 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-28 10:03:40,997 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-28 10:03:40,998 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-28 10:03:40,998 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-28 10:03:40,998 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-28 10:03:40,998 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-28 10:03:40,998 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-28 10:03:40,999 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-28 10:03:40,999 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-28 10:03:40,999 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-28 10:03:40,999 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-28 10:03:41,000 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-28 10:03:41,000 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-28 10:03:41,000 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-28 10:03:41,000 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-28 10:03:41,000 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-28 10:03:41,000 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-28 10:03:41,001 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-28 10:03:41,001 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-28 10:03:41,001 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-28 10:03:41,001 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-28 10:03:41,001 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-28 10:03:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 10:03:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-28 10:03:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-28 10:03:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-28 10:03:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-28 10:03:41,003 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-28 10:03:41,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 10:03:41,003 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-28 10:03:41,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-28 10:03:41,003 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-28 10:03:41,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 10:03:41,004 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-28 10:03:41,004 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-28 10:03:41,004 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-28 10:03:41,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 10:03:41,005 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-28 10:03:41,005 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-28 10:03:41,005 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-28 10:03:41,005 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-28 10:03:41,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-28 10:03:41,005 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-28 10:03:41,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 10:03:41,006 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-28 10:03:41,006 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-28 10:03:41,006 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-28 10:03:41,006 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-28 10:03:41,007 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-28 10:03:41,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-28 10:03:41,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-28 10:03:41,007 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-28 10:03:41,007 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-28 10:03:41,008 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-28 10:03:41,008 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-28 10:03:41,008 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-28 10:03:41,008 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-28 10:03:41,008 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-28 10:03:41,008 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-28 10:03:41,009 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-28 10:03:41,009 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-28 10:03:41,009 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-28 10:03:41,009 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-28 10:03:41,009 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-28 10:03:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-28 10:03:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-28 10:03:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-28 10:03:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-28 10:03:41,010 INFO L130 BoogieDeclarations]: Found specification of procedure f_22_get [2019-11-28 10:03:41,011 INFO L130 BoogieDeclarations]: Found specification of procedure f_22_put [2019-11-28 10:03:41,011 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-28 10:03:41,011 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 10:03:41,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 10:03:41,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 10:03:41,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-28 10:03:41,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 10:03:41,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-28 10:03:41,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-28 10:03:41,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-28 10:03:41,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-28 10:03:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-28 10:03:41,623 WARN L757 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 10:03:41,992 WARN L757 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 10:03:42,365 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 10:03:42,365 INFO L297 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-28 10:03:42,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:03:42 BoogieIcfgContainer [2019-11-28 10:03:42,367 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 10:03:42,370 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 10:03:42,371 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 10:03:42,374 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 10:03:42,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 10:03:39" (1/3) ... [2019-11-28 10:03:42,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de554a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:03:42, skipping insertion in model container [2019-11-28 10:03:42,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:03:40" (2/3) ... [2019-11-28 10:03:42,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de554a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:03:42, skipping insertion in model container [2019-11-28 10:03:42,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:03:42" (3/3) ... [2019-11-28 10:03:42,379 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test22_5.i [2019-11-28 10:03:42,388 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 10:03:42,396 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2019-11-28 10:03:42,405 INFO L249 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2019-11-28 10:03:42,422 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 10:03:42,422 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 10:03:42,423 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 10:03:42,423 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 10:03:42,423 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 10:03:42,423 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 10:03:42,423 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 10:03:42,424 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 10:03:42,444 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states. [2019-11-28 10:03:42,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 10:03:42,453 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:42,454 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 10:03:42,455 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 10:03:42,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:42,461 INFO L82 PathProgramCache]: Analyzing trace with hash -604206848, now seen corresponding path program 1 times [2019-11-28 10:03:42,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:42,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [166544242] [2019-11-28 10:03:42,474 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 10:03:42,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:03:42,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 10:03:42,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:42,730 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 10:03:42,731 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:03:42,752 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:03:42,752 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:03:42,753 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 10:03:42,787 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 10:03:42,791 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:42,855 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 10:03:42,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [166544242] [2019-11-28 10:03:42,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:03:42,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-28 10:03:42,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347361310] [2019-11-28 10:03:42,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 10:03:42,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:42,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 10:03:42,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 10:03:42,888 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 5 states. [2019-11-28 10:03:43,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:03:43,214 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2019-11-28 10:03:43,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 10:03:43,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-28 10:03:43,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:03:43,244 INFO L225 Difference]: With dead ends: 137 [2019-11-28 10:03:43,253 INFO L226 Difference]: Without dead ends: 134 [2019-11-28 10:03:43,255 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 10:03:43,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-28 10:03:43,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 128. [2019-11-28 10:03:43,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-28 10:03:43,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2019-11-28 10:03:43,314 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 17 [2019-11-28 10:03:43,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:03:43,315 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2019-11-28 10:03:43,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 10:03:43,316 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2019-11-28 10:03:43,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 10:03:43,317 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:43,317 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 10:03:43,528 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-28 10:03:43,529 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 10:03:43,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:43,530 INFO L82 PathProgramCache]: Analyzing trace with hash -604206847, now seen corresponding path program 1 times [2019-11-28 10:03:43,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:43,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1861492375] [2019-11-28 10:03:43,531 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 10:03:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:03:43,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 10:03:43,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:43,703 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 10:03:43,704 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:03:43,710 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:03:43,711 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:03:43,711 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 10:03:43,753 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 10:03:43,753 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:44,093 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 10:03:44,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1861492375] [2019-11-28 10:03:44,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:03:44,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-28 10:03:44,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827872778] [2019-11-28 10:03:44,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 10:03:44,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:44,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 10:03:44,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-28 10:03:44,098 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand 10 states. [2019-11-28 10:03:44,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:03:44,849 INFO L93 Difference]: Finished difference Result 133 states and 144 transitions. [2019-11-28 10:03:44,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 10:03:44,850 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-28 10:03:44,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:03:44,853 INFO L225 Difference]: With dead ends: 133 [2019-11-28 10:03:44,853 INFO L226 Difference]: Without dead ends: 133 [2019-11-28 10:03:44,854 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 10:03:44,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-28 10:03:44,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 128. [2019-11-28 10:03:44,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-28 10:03:44,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2019-11-28 10:03:44,868 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 17 [2019-11-28 10:03:44,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:03:44,868 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2019-11-28 10:03:44,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 10:03:44,869 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2019-11-28 10:03:44,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 10:03:44,869 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:44,870 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 10:03:45,075 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-28 10:03:45,076 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 10:03:45,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:45,078 INFO L82 PathProgramCache]: Analyzing trace with hash -575577697, now seen corresponding path program 1 times [2019-11-28 10:03:45,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:45,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [145196542] [2019-11-28 10:03:45,079 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 10:03:45,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:03:45,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 10:03:45,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:45,236 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 10:03:45,236 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:45,280 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 10:03:45,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [145196542] [2019-11-28 10:03:45,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:03:45,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-28 10:03:45,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021788599] [2019-11-28 10:03:45,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 10:03:45,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:45,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 10:03:45,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 10:03:45,282 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 5 states. [2019-11-28 10:03:45,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:03:45,311 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2019-11-28 10:03:45,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 10:03:45,312 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-28 10:03:45,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:03:45,314 INFO L225 Difference]: With dead ends: 127 [2019-11-28 10:03:45,314 INFO L226 Difference]: Without dead ends: 127 [2019-11-28 10:03:45,314 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 10:03:45,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-28 10:03:45,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2019-11-28 10:03:45,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-28 10:03:45,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2019-11-28 10:03:45,327 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 17 [2019-11-28 10:03:45,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:03:45,327 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2019-11-28 10:03:45,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 10:03:45,327 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2019-11-28 10:03:45,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 10:03:45,329 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:45,329 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 10:03:45,551 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-28 10:03:45,552 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 10:03:45,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:45,553 INFO L82 PathProgramCache]: Analyzing trace with hash -811306797, now seen corresponding path program 1 times [2019-11-28 10:03:45,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:45,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830007665] [2019-11-28 10:03:45,554 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 10:03:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:03:45,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 10:03:45,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:45,768 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 10:03:45,768 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:45,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 10:03:45,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1830007665] [2019-11-28 10:03:45,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:03:45,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-28 10:03:45,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996006944] [2019-11-28 10:03:45,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 10:03:45,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:45,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 10:03:45,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 10:03:45,845 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand 5 states. [2019-11-28 10:03:45,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:03:45,869 INFO L93 Difference]: Finished difference Result 127 states and 134 transitions. [2019-11-28 10:03:45,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 10:03:45,871 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 10:03:45,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:03:45,873 INFO L225 Difference]: With dead ends: 127 [2019-11-28 10:03:45,873 INFO L226 Difference]: Without dead ends: 127 [2019-11-28 10:03:45,873 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 10:03:45,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-28 10:03:45,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2019-11-28 10:03:45,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-28 10:03:45,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2019-11-28 10:03:45,885 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 31 [2019-11-28 10:03:45,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:03:45,885 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2019-11-28 10:03:45,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 10:03:45,888 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2019-11-28 10:03:45,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 10:03:45,889 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:45,890 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 10:03:46,090 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-28 10:03:46,090 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 10:03:46,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:46,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1220131022, now seen corresponding path program 1 times [2019-11-28 10:03:46,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:46,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1555998021] [2019-11-28 10:03:46,092 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 10:03:46,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:03:46,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-28 10:03:46,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:46,355 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 10:03:46,356 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:46,406 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 10:03:46,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1555998021] [2019-11-28 10:03:46,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:03:46,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 9 [2019-11-28 10:03:46,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411360571] [2019-11-28 10:03:46,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 10:03:46,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:46,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 10:03:46,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-28 10:03:46,408 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand 9 states. [2019-11-28 10:03:46,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:03:46,547 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2019-11-28 10:03:46,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 10:03:46,548 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-11-28 10:03:46,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:03:46,550 INFO L225 Difference]: With dead ends: 142 [2019-11-28 10:03:46,550 INFO L226 Difference]: Without dead ends: 142 [2019-11-28 10:03:46,551 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 10:03:46,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-28 10:03:46,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2019-11-28 10:03:46,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-11-28 10:03:46,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 146 transitions. [2019-11-28 10:03:46,562 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 146 transitions. Word has length 31 [2019-11-28 10:03:46,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:03:46,563 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 146 transitions. [2019-11-28 10:03:46,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 10:03:46,563 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 146 transitions. [2019-11-28 10:03:46,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 10:03:46,564 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:46,565 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 10:03:46,779 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-28 10:03:46,780 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 10:03:46,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:46,781 INFO L82 PathProgramCache]: Analyzing trace with hash 536113147, now seen corresponding path program 1 times [2019-11-28 10:03:46,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:46,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1469639325] [2019-11-28 10:03:46,783 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 10:03:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:03:46,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 10:03:46,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:46,933 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 10:03:46,934 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:46,986 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 10:03:46,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1469639325] [2019-11-28 10:03:46,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:03:46,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-28 10:03:46,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729047143] [2019-11-28 10:03:46,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 10:03:46,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:46,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 10:03:46,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 10:03:46,990 INFO L87 Difference]: Start difference. First operand 138 states and 146 transitions. Second operand 6 states. [2019-11-28 10:03:47,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:03:47,031 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2019-11-28 10:03:47,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 10:03:47,038 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-28 10:03:47,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:03:47,039 INFO L225 Difference]: With dead ends: 144 [2019-11-28 10:03:47,040 INFO L226 Difference]: Without dead ends: 140 [2019-11-28 10:03:47,040 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 10:03:47,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-28 10:03:47,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2019-11-28 10:03:47,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-28 10:03:47,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 148 transitions. [2019-11-28 10:03:47,058 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 148 transitions. Word has length 32 [2019-11-28 10:03:47,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:03:47,058 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 148 transitions. [2019-11-28 10:03:47,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 10:03:47,060 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 148 transitions. [2019-11-28 10:03:47,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 10:03:47,063 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:47,063 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 10:03:47,265 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-28 10:03:47,267 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 10:03:47,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:47,268 INFO L82 PathProgramCache]: Analyzing trace with hash 690495131, now seen corresponding path program 1 times [2019-11-28 10:03:47,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:47,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [317936856] [2019-11-28 10:03:47,270 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 10:03:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:03:47,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 10:03:47,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:47,456 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 10:03:47,457 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:47,585 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 10:03:47,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [317936856] [2019-11-28 10:03:47,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 10:03:47,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-28 10:03:47,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966287273] [2019-11-28 10:03:47,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 10:03:47,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:47,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 10:03:47,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-28 10:03:47,589 INFO L87 Difference]: Start difference. First operand 140 states and 148 transitions. Second operand 10 states. [2019-11-28 10:03:47,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:03:47,826 INFO L93 Difference]: Finished difference Result 148 states and 158 transitions. [2019-11-28 10:03:47,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 10:03:47,827 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-11-28 10:03:47,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:03:47,829 INFO L225 Difference]: With dead ends: 148 [2019-11-28 10:03:47,829 INFO L226 Difference]: Without dead ends: 144 [2019-11-28 10:03:47,830 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 10:03:47,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-28 10:03:47,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2019-11-28 10:03:47,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-28 10:03:47,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions. [2019-11-28 10:03:47,838 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 34 [2019-11-28 10:03:47,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:03:47,839 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions. [2019-11-28 10:03:47,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 10:03:47,839 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2019-11-28 10:03:47,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 10:03:47,841 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:47,841 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 10:03:48,047 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-28 10:03:48,048 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 10:03:48,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:48,049 INFO L82 PathProgramCache]: Analyzing trace with hash 780110635, now seen corresponding path program 1 times [2019-11-28 10:03:48,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:48,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [153246026] [2019-11-28 10:03:48,050 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 10:03:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:03:48,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 10:03:48,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:48,245 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 10:03:48,247 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:48,455 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 10:03:48,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [153246026] [2019-11-28 10:03:48,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:03:48,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-28 10:03:48,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385401879] [2019-11-28 10:03:48,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 10:03:48,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:48,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 10:03:48,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 10:03:48,458 INFO L87 Difference]: Start difference. First operand 144 states and 152 transitions. Second operand 3 states. [2019-11-28 10:03:48,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:03:48,631 INFO L93 Difference]: Finished difference Result 157 states and 165 transitions. [2019-11-28 10:03:48,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 10:03:48,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-28 10:03:48,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:03:48,634 INFO L225 Difference]: With dead ends: 157 [2019-11-28 10:03:48,634 INFO L226 Difference]: Without dead ends: 137 [2019-11-28 10:03:48,635 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 10:03:48,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-28 10:03:48,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 127. [2019-11-28 10:03:48,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-28 10:03:48,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 133 transitions. [2019-11-28 10:03:48,640 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 133 transitions. Word has length 36 [2019-11-28 10:03:48,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:03:48,641 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 133 transitions. [2019-11-28 10:03:48,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 10:03:48,641 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 133 transitions. [2019-11-28 10:03:48,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-28 10:03:48,642 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:48,643 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 10:03:48,848 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-28 10:03:48,850 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 10:03:48,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:48,852 INFO L82 PathProgramCache]: Analyzing trace with hash -2002385957, now seen corresponding path program 2 times [2019-11-28 10:03:48,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:48,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [281387673] [2019-11-28 10:03:48,852 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 10:03:48,991 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 10:03:48,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 10:03:48,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 10:03:48,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:49,014 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 10:03:49,014 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:03:49,023 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:03:49,023 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:03:49,024 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 10:03:49,205 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 10:03:49,205 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:49,288 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 10:03:49,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [281387673] [2019-11-28 10:03:49,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:03:49,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-28 10:03:49,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779683628] [2019-11-28 10:03:49,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 10:03:49,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:49,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 10:03:49,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-28 10:03:49,290 INFO L87 Difference]: Start difference. First operand 127 states and 133 transitions. Second operand 12 states. [2019-11-28 10:03:50,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:03:50,276 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2019-11-28 10:03:50,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 10:03:50,277 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-11-28 10:03:50,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:03:50,279 INFO L225 Difference]: With dead ends: 152 [2019-11-28 10:03:50,279 INFO L226 Difference]: Without dead ends: 152 [2019-11-28 10:03:50,280 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 10:03:50,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-28 10:03:50,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 126. [2019-11-28 10:03:50,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-28 10:03:50,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 132 transitions. [2019-11-28 10:03:50,292 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 132 transitions. Word has length 38 [2019-11-28 10:03:50,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:03:50,292 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 132 transitions. [2019-11-28 10:03:50,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 10:03:50,292 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2019-11-28 10:03:50,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-28 10:03:50,296 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:50,296 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 10:03:50,515 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-28 10:03:50,518 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 10:03:50,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:50,519 INFO L82 PathProgramCache]: Analyzing trace with hash -2002385956, now seen corresponding path program 1 times [2019-11-28 10:03:50,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:50,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [281341976] [2019-11-28 10:03:50,521 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 10:03:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:03:50,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 10:03:50,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:50,783 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 10:03:50,783 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:51,175 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 10:03:51,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [281341976] [2019-11-28 10:03:51,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 10:03:51,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-28 10:03:51,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563010647] [2019-11-28 10:03:51,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 10:03:51,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:51,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 10:03:51,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-11-28 10:03:51,177 INFO L87 Difference]: Start difference. First operand 126 states and 132 transitions. Second operand 18 states. [2019-11-28 10:03:52,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:03:52,117 INFO L93 Difference]: Finished difference Result 138 states and 150 transitions. [2019-11-28 10:03:52,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 10:03:52,119 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2019-11-28 10:03:52,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:03:52,121 INFO L225 Difference]: With dead ends: 138 [2019-11-28 10:03:52,121 INFO L226 Difference]: Without dead ends: 134 [2019-11-28 10:03:52,122 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=223, Invalid=377, Unknown=0, NotChecked=0, Total=600 [2019-11-28 10:03:52,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-28 10:03:52,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-11-28 10:03:52,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-28 10:03:52,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 140 transitions. [2019-11-28 10:03:52,128 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 140 transitions. Word has length 38 [2019-11-28 10:03:52,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:03:52,129 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 140 transitions. [2019-11-28 10:03:52,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 10:03:52,129 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 140 transitions. [2019-11-28 10:03:52,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-28 10:03:52,133 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:52,133 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 10:03:52,344 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-28 10:03:52,348 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 10:03:52,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:52,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1528032860, now seen corresponding path program 2 times [2019-11-28 10:03:52,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:52,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1011409040] [2019-11-28 10:03:52,349 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 10:03:52,481 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 10:03:52,482 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 10:03:52,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 10:03:52,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:52,503 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 10:03:52,504 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:03:52,515 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:03:52,516 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:03:52,516 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 10:03:52,750 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 10:03:52,750 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:53,676 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 10:03:53,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1011409040] [2019-11-28 10:03:53,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:03:53,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-28 10:03:53,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266515909] [2019-11-28 10:03:53,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-28 10:03:53,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:53,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-28 10:03:53,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-28 10:03:53,679 INFO L87 Difference]: Start difference. First operand 134 states and 140 transitions. Second operand 23 states. [2019-11-28 10:03:56,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:03:56,214 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2019-11-28 10:03:56,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 10:03:56,215 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2019-11-28 10:03:56,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:03:56,217 INFO L225 Difference]: With dead ends: 133 [2019-11-28 10:03:56,217 INFO L226 Difference]: Without dead ends: 133 [2019-11-28 10:03:56,217 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-11-28 10:03:56,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-28 10:03:56,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-11-28 10:03:56,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-28 10:03:56,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 139 transitions. [2019-11-28 10:03:56,224 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 139 transitions. Word has length 46 [2019-11-28 10:03:56,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:03:56,225 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 139 transitions. [2019-11-28 10:03:56,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-28 10:03:56,225 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 139 transitions. [2019-11-28 10:03:56,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 10:03:56,226 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:56,226 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 10:03:56,437 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-28 10:03:56,437 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 10:03:56,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:56,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1472640772, now seen corresponding path program 1 times [2019-11-28 10:03:56,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:56,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1500041523] [2019-11-28 10:03:56,440 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 10:03:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:03:56,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-28 10:03:56,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:56,895 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 10:03:56,895 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:57,037 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-28 10:03:57,894 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 10:03:57,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1500041523] [2019-11-28 10:03:57,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 10:03:57,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2019-11-28 10:03:57,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51948804] [2019-11-28 10:03:57,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-28 10:03:57,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:57,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-28 10:03:57,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2019-11-28 10:03:57,897 INFO L87 Difference]: Start difference. First operand 133 states and 139 transitions. Second operand 34 states. [2019-11-28 10:03:58,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:03:58,633 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2019-11-28 10:03:58,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 10:03:58,634 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 51 [2019-11-28 10:03:58,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:03:58,635 INFO L225 Difference]: With dead ends: 139 [2019-11-28 10:03:58,635 INFO L226 Difference]: Without dead ends: 135 [2019-11-28 10:03:58,636 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 10:03:58,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-28 10:03:58,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-11-28 10:03:58,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-28 10:03:58,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 141 transitions. [2019-11-28 10:03:58,642 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 141 transitions. Word has length 51 [2019-11-28 10:03:58,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:03:58,643 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 141 transitions. [2019-11-28 10:03:58,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-28 10:03:58,643 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 141 transitions. [2019-11-28 10:03:58,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 10:03:58,644 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:58,645 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 10:03:58,857 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-28 10:03:58,857 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 10:03:58,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:58,857 INFO L82 PathProgramCache]: Analyzing trace with hash 680412260, now seen corresponding path program 2 times [2019-11-28 10:03:58,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:58,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1039342] [2019-11-28 10:03:58,858 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 10:03:58,997 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 10:03:58,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 10:03:59,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 10:03:59,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:59,013 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 10:03:59,014 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:03:59,018 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:03:59,018 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:03:59,018 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 10:03:59,182 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 10:03:59,183 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:59,250 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 10:03:59,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1039342] [2019-11-28 10:03:59,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:03:59,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-28 10:03:59,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536678722] [2019-11-28 10:03:59,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 10:03:59,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:59,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 10:03:59,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-28 10:03:59,252 INFO L87 Difference]: Start difference. First operand 135 states and 141 transitions. Second operand 12 states. [2019-11-28 10:04:00,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:04:00,145 INFO L93 Difference]: Finished difference Result 159 states and 173 transitions. [2019-11-28 10:04:00,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 10:04:00,145 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-11-28 10:04:00,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:04:00,147 INFO L225 Difference]: With dead ends: 159 [2019-11-28 10:04:00,147 INFO L226 Difference]: Without dead ends: 159 [2019-11-28 10:04:00,148 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-28 10:04:00,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-28 10:04:00,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 133. [2019-11-28 10:04:00,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-28 10:04:00,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 139 transitions. [2019-11-28 10:04:00,154 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 139 transitions. Word has length 53 [2019-11-28 10:04:00,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:04:00,155 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 139 transitions. [2019-11-28 10:04:00,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 10:04:00,155 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 139 transitions. [2019-11-28 10:04:00,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 10:04:00,156 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:04:00,156 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 10:04:00,364 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-28 10:04:00,365 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 10:04:00,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:04:00,366 INFO L82 PathProgramCache]: Analyzing trace with hash 680412261, now seen corresponding path program 1 times [2019-11-28 10:04:00,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:04:00,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [303995396] [2019-11-28 10:04:00,367 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 10:04:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:04:00,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 10:04:00,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:04:00,578 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 10:04:00,578 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:04:00,591 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:04:00,591 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:04:00,591 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 10:04:00,822 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 10:04:00,823 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:04:01,632 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 10:04:01,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [303995396] [2019-11-28 10:04:01,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:04:01,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-28 10:04:01,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707508956] [2019-11-28 10:04:01,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-28 10:04:01,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:04:01,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-28 10:04:01,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-28 10:04:01,635 INFO L87 Difference]: Start difference. First operand 133 states and 139 transitions. Second operand 23 states. [2019-11-28 10:04:03,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:04:03,842 INFO L93 Difference]: Finished difference Result 131 states and 137 transitions. [2019-11-28 10:04:03,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 10:04:03,843 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2019-11-28 10:04:03,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:04:03,845 INFO L225 Difference]: With dead ends: 131 [2019-11-28 10:04:03,845 INFO L226 Difference]: Without dead ends: 131 [2019-11-28 10:04:03,846 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 10:04:03,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-28 10:04:03,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-11-28 10:04:03,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-28 10:04:03,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 137 transitions. [2019-11-28 10:04:03,851 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 137 transitions. Word has length 53 [2019-11-28 10:04:03,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:04:03,851 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 137 transitions. [2019-11-28 10:04:03,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-28 10:04:03,852 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 137 transitions. [2019-11-28 10:04:03,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-28 10:04:03,853 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:04:03,853 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 10:04:04,064 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-28 10:04:04,065 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 10:04:04,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:04:04,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1848313328, now seen corresponding path program 1 times [2019-11-28 10:04:04,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:04:04,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [60293701] [2019-11-28 10:04:04,067 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 10:04:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:04:04,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 10:04:04,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:04:04,284 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 10:04:04,285 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:04:04,413 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 10:04:04,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [60293701] [2019-11-28 10:04:04,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:04:04,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2019-11-28 10:04:04,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46691747] [2019-11-28 10:04:04,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 10:04:04,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:04:04,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 10:04:04,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 10:04:04,414 INFO L87 Difference]: Start difference. First operand 131 states and 137 transitions. Second operand 8 states. [2019-11-28 10:04:04,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:04:04,462 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2019-11-28 10:04:04,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 10:04:04,462 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2019-11-28 10:04:04,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:04:04,463 INFO L225 Difference]: With dead ends: 133 [2019-11-28 10:04:04,463 INFO L226 Difference]: Without dead ends: 131 [2019-11-28 10:04:04,467 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 10:04:04,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-28 10:04:04,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-11-28 10:04:04,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-28 10:04:04,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 136 transitions. [2019-11-28 10:04:04,472 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 136 transitions. Word has length 60 [2019-11-28 10:04:04,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:04:04,472 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 136 transitions. [2019-11-28 10:04:04,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 10:04:04,472 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 136 transitions. [2019-11-28 10:04:04,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-28 10:04:04,473 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:04:04,473 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 10:04:04,674 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-28 10:04:04,674 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 10:04:04,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:04:04,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1123996245, now seen corresponding path program 1 times [2019-11-28 10:04:04,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:04:04,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1349293192] [2019-11-28 10:04:04,677 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 10:04:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:04:04,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 10:04:04,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:04:04,941 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 10:04:04,942 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:04:05,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:04:05,173 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 10:04:05,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1349293192] [2019-11-28 10:04:05,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:04:05,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 11 [2019-11-28 10:04:05,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433715837] [2019-11-28 10:04:05,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 10:04:05,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:04:05,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 10:04:05,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-28 10:04:05,175 INFO L87 Difference]: Start difference. First operand 131 states and 136 transitions. Second operand 11 states. [2019-11-28 10:04:05,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:04:05,266 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2019-11-28 10:04:05,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 10:04:05,267 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-11-28 10:04:05,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:04:05,268 INFO L225 Difference]: With dead ends: 135 [2019-11-28 10:04:05,269 INFO L226 Difference]: Without dead ends: 131 [2019-11-28 10:04:05,269 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-28 10:04:05,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-28 10:04:05,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-11-28 10:04:05,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-28 10:04:05,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2019-11-28 10:04:05,274 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 65 [2019-11-28 10:04:05,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:04:05,275 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2019-11-28 10:04:05,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 10:04:05,275 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2019-11-28 10:04:05,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-28 10:04:05,276 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:04:05,276 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 10:04:05,477 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-11-28 10:04:05,477 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 10:04:05,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:04:05,478 INFO L82 PathProgramCache]: Analyzing trace with hash -638447166, now seen corresponding path program 1 times [2019-11-28 10:04:05,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:04:05,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1119710350] [2019-11-28 10:04:05,479 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 10:04:05,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:04:05,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-28 10:04:05,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:04:05,718 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 10:04:05,718 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:04:05,720 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:04:05,720 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:04:05,720 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 10:04:06,031 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 10:04:06,032 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:04:06,247 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 10:04:06,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1119710350] [2019-11-28 10:04:06,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:04:06,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18, 17] imperfect sequences [] total 18 [2019-11-28 10:04:06,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758880107] [2019-11-28 10:04:06,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-28 10:04:06,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:04:06,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-28 10:04:06,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-11-28 10:04:06,250 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand 19 states. [2019-11-28 10:04:07,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:04:07,729 INFO L93 Difference]: Finished difference Result 183 states and 200 transitions. [2019-11-28 10:04:07,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-28 10:04:07,730 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 76 [2019-11-28 10:04:07,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:04:07,731 INFO L225 Difference]: With dead ends: 183 [2019-11-28 10:04:07,731 INFO L226 Difference]: Without dead ends: 183 [2019-11-28 10:04:07,732 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 10:04:07,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-28 10:04:07,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 157. [2019-11-28 10:04:07,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-28 10:04:07,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 167 transitions. [2019-11-28 10:04:07,739 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 167 transitions. Word has length 76 [2019-11-28 10:04:07,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:04:07,740 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 167 transitions. [2019-11-28 10:04:07,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-28 10:04:07,740 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 167 transitions. [2019-11-28 10:04:07,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-28 10:04:07,741 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:04:07,741 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 10:04:07,960 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-11-28 10:04:07,961 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 10:04:07,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:04:07,961 INFO L82 PathProgramCache]: Analyzing trace with hash -638447165, now seen corresponding path program 1 times [2019-11-28 10:04:07,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:04:07,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [876833046] [2019-11-28 10:04:07,963 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 10:04:08,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:04:08,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-28 10:04:08,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:04:08,210 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 10:04:08,210 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:04:08,220 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:04:08,220 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:04:08,220 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 10:04:08,680 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 10:04:08,680 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:04:10,741 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 10:04:10,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [876833046] [2019-11-28 10:04:10,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:04:10,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19, 18] imperfect sequences [] total 36 [2019-11-28 10:04:10,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130405302] [2019-11-28 10:04:10,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-28 10:04:10,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:04:10,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-28 10:04:10,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1229, Unknown=0, NotChecked=0, Total=1332 [2019-11-28 10:04:10,744 INFO L87 Difference]: Start difference. First operand 157 states and 167 transitions. Second operand 37 states. [2019-11-28 10:04:15,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:04:15,359 INFO L93 Difference]: Finished difference Result 155 states and 163 transitions. [2019-11-28 10:04:15,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 10:04:15,360 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 76 [2019-11-28 10:04:15,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:04:15,361 INFO L225 Difference]: With dead ends: 155 [2019-11-28 10:04:15,361 INFO L226 Difference]: Without dead ends: 155 [2019-11-28 10:04:15,362 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 112 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=151, Invalid=1741, Unknown=0, NotChecked=0, Total=1892 [2019-11-28 10:04:15,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-28 10:04:15,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-11-28 10:04:15,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-28 10:04:15,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 163 transitions. [2019-11-28 10:04:15,368 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 163 transitions. Word has length 76 [2019-11-28 10:04:15,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:04:15,368 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 163 transitions. [2019-11-28 10:04:15,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-28 10:04:15,368 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 163 transitions. [2019-11-28 10:04:15,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-28 10:04:15,369 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:04:15,370 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 10:04:15,581 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-11-28 10:04:15,582 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 10:04:15,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:04:15,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1131008798, now seen corresponding path program 1 times [2019-11-28 10:04:15,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:04:15,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1809119291] [2019-11-28 10:04:15,584 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 10:04:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:04:15,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 10:04:15,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:04:15,900 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 10:04:15,901 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:04:15,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:04:16,141 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 10:04:16,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1809119291] [2019-11-28 10:04:16,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:04:16,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 14 [2019-11-28 10:04:16,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475094342] [2019-11-28 10:04:16,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 10:04:16,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:04:16,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 10:04:16,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-11-28 10:04:16,144 INFO L87 Difference]: Start difference. First operand 155 states and 163 transitions. Second operand 14 states. [2019-11-28 10:04:16,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:04:16,290 INFO L93 Difference]: Finished difference Result 159 states and 165 transitions. [2019-11-28 10:04:16,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 10:04:16,291 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 83 [2019-11-28 10:04:16,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:04:16,293 INFO L225 Difference]: With dead ends: 159 [2019-11-28 10:04:16,293 INFO L226 Difference]: Without dead ends: 153 [2019-11-28 10:04:16,293 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 10:04:16,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-28 10:04:16,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-11-28 10:04:16,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-28 10:04:16,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 159 transitions. [2019-11-28 10:04:16,300 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 159 transitions. Word has length 83 [2019-11-28 10:04:16,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:04:16,300 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 159 transitions. [2019-11-28 10:04:16,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 10:04:16,300 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 159 transitions. [2019-11-28 10:04:16,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-28 10:04:16,301 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:04:16,301 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 10:04:16,505 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-11-28 10:04:16,506 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 10:04:16,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:04:16,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1628283129, now seen corresponding path program 1 times [2019-11-28 10:04:16,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:04:16,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1250401128] [2019-11-28 10:04:16,508 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 10:04:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:04:16,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-28 10:04:16,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:04:16,779 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 10:04:16,779 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:04:16,781 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:04:16,781 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:04:16,781 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 10:04:17,190 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 10:04:17,191 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:04:17,472 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 10:04:17,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1250401128] [2019-11-28 10:04:17,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:04:17,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22, 21] imperfect sequences [] total 22 [2019-11-28 10:04:17,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326237166] [2019-11-28 10:04:17,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-28 10:04:17,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:04:17,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-28 10:04:17,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-11-28 10:04:17,476 INFO L87 Difference]: Start difference. First operand 153 states and 159 transitions. Second operand 23 states. [2019-11-28 10:04:19,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:04:19,516 INFO L93 Difference]: Finished difference Result 186 states and 202 transitions. [2019-11-28 10:04:19,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-28 10:04:19,516 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 89 [2019-11-28 10:04:19,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:04:19,518 INFO L225 Difference]: With dead ends: 186 [2019-11-28 10:04:19,518 INFO L226 Difference]: Without dead ends: 186 [2019-11-28 10:04:19,519 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 10:04:19,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-28 10:04:19,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 159. [2019-11-28 10:04:19,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-11-28 10:04:19,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 169 transitions. [2019-11-28 10:04:19,526 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 169 transitions. Word has length 89 [2019-11-28 10:04:19,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:04:19,527 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 169 transitions. [2019-11-28 10:04:19,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-28 10:04:19,527 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 169 transitions. [2019-11-28 10:04:19,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-28 10:04:19,528 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:04:19,528 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 10:04:19,740 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-11-28 10:04:19,741 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 10:04:19,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:04:19,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1628283130, now seen corresponding path program 1 times [2019-11-28 10:04:19,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:04:19,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [544854220] [2019-11-28 10:04:19,743 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 10:04:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:04:20,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 50 conjunts are in the unsatisfiable core [2019-11-28 10:04:20,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:04:20,071 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 10:04:20,071 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:04:20,080 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:04:20,081 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:04:20,081 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 10:04:20,756 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 10:04:20,756 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:04:23,589 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 10:04:23,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [544854220] [2019-11-28 10:04:23,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:04:23,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23, 22] imperfect sequences [] total 44 [2019-11-28 10:04:23,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619994541] [2019-11-28 10:04:23,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-11-28 10:04:23,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:04:23,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-11-28 10:04:23,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1853, Unknown=0, NotChecked=0, Total=1980 [2019-11-28 10:04:23,594 INFO L87 Difference]: Start difference. First operand 159 states and 169 transitions. Second operand 45 states. [2019-11-28 10:04:28,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:04:28,787 INFO L93 Difference]: Finished difference Result 157 states and 166 transitions. [2019-11-28 10:04:28,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-28 10:04:28,789 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 89 [2019-11-28 10:04:28,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:04:28,790 INFO L225 Difference]: With dead ends: 157 [2019-11-28 10:04:28,790 INFO L226 Difference]: Without dead ends: 157 [2019-11-28 10:04:28,791 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 128 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=189, Invalid=2673, Unknown=0, NotChecked=0, Total=2862 [2019-11-28 10:04:28,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-28 10:04:28,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-11-28 10:04:28,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-28 10:04:28,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 166 transitions. [2019-11-28 10:04:28,801 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 166 transitions. Word has length 89 [2019-11-28 10:04:28,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:04:28,802 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 166 transitions. [2019-11-28 10:04:28,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-11-28 10:04:28,802 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 166 transitions. [2019-11-28 10:04:28,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-28 10:04:28,804 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:04:28,804 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 10:04:29,024 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-11-28 10:04:29,025 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 10:04:29,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:04:29,025 INFO L82 PathProgramCache]: Analyzing trace with hash 822322196, now seen corresponding path program 1 times [2019-11-28 10:04:29,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:04:29,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [734680809] [2019-11-28 10:04:29,026 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 10:04:29,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:04:29,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-28 10:04:29,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:04:30,222 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 10:04:30,222 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:04:31,184 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 10:04:31,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [734680809] [2019-11-28 10:04:31,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:04:31,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23, 21] imperfect sequences [] total 43 [2019-11-28 10:04:31,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391509725] [2019-11-28 10:04:31,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-11-28 10:04:31,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:04:31,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-11-28 10:04:31,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1726, Unknown=0, NotChecked=0, Total=1892 [2019-11-28 10:04:31,188 INFO L87 Difference]: Start difference. First operand 157 states and 166 transitions. Second operand 44 states. [2019-11-28 10:04:34,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:04:34,142 INFO L93 Difference]: Finished difference Result 156 states and 165 transitions. [2019-11-28 10:04:34,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-28 10:04:34,145 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 92 [2019-11-28 10:04:34,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:04:34,146 INFO L225 Difference]: With dead ends: 156 [2019-11-28 10:04:34,146 INFO L226 Difference]: Without dead ends: 156 [2019-11-28 10:04:34,147 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 136 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=230, Invalid=2422, Unknown=0, NotChecked=0, Total=2652 [2019-11-28 10:04:34,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-28 10:04:34,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2019-11-28 10:04:34,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-28 10:04:34,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 165 transitions. [2019-11-28 10:04:34,152 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 165 transitions. Word has length 92 [2019-11-28 10:04:34,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:04:34,153 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 165 transitions. [2019-11-28 10:04:34,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-11-28 10:04:34,153 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 165 transitions. [2019-11-28 10:04:34,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-28 10:04:34,154 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:04:34,154 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 10:04:34,368 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-11-28 10:04:34,369 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 10:04:34,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:04:34,369 INFO L82 PathProgramCache]: Analyzing trace with hash -692582595, now seen corresponding path program 1 times [2019-11-28 10:04:34,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:04:34,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1560302716] [2019-11-28 10:04:34,371 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 10:04:34,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:04:34,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 122 conjunts are in the unsatisfiable core [2019-11-28 10:04:34,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:04:34,761 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 10:04:34,761 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:04:34,769 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:04:34,770 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:04:34,770 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-11-28 10:04:34,812 INFO L343 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2019-11-28 10:04:34,813 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 10:04:34,813 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:04:34,824 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:04:34,825 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:04:34,825 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-11-28 10:04:34,933 INFO L343 Elim1Store]: treesize reduction 10, result has 87.7 percent of original size [2019-11-28 10:04:34,933 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 10:04:34,934 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:04:34,991 INFO L588 ElimStorePlain]: treesize reduction 54, result has 40.0 percent of original size [2019-11-28 10:04:34,991 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:04:34,992 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2019-11-28 10:04:59,671 WARN L192 SmtUtils]: Spent 24.61 s on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-11-28 10:04:59,672 INFO L343 Elim1Store]: treesize reduction 43, result has 70.9 percent of original size [2019-11-28 10:04:59,672 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 10:04:59,673 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:04:59,763 INFO L588 ElimStorePlain]: treesize reduction 96, result has 33.3 percent of original size [2019-11-28 10:04:59,763 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:04:59,763 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:48 [2019-11-28 10:04:59,918 INFO L343 Elim1Store]: treesize reduction 172, result has 16.9 percent of original size [2019-11-28 10:04:59,918 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 10:04:59,919 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:04:59,949 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:04:59,949 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:04:59,949 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:59 [2019-11-28 10:05:00,195 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 28 [2019-11-28 10:05:00,195 INFO L343 Elim1Store]: treesize reduction 246, result has 15.2 percent of original size [2019-11-28 10:05:00,196 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 10:05:00,196 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:05:00,245 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:05:00,245 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:05:00,245 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:74, output treesize:70 [2019-11-28 10:05:00,815 WARN L192 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 69 [2019-11-28 10:05:00,816 INFO L343 Elim1Store]: treesize reduction 170, result has 57.2 percent of original size [2019-11-28 10:05:00,816 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 10:05:00,817 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:05:03,070 WARN L192 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-11-28 10:05:03,071 INFO L588 ElimStorePlain]: treesize reduction 174, result has 32.0 percent of original size [2019-11-28 10:05:03,072 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:05:03,072 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:86, output treesize:82 [2019-11-28 10:05:03,411 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 38 [2019-11-28 10:05:03,412 INFO L343 Elim1Store]: treesize reduction 430, result has 12.6 percent of original size [2019-11-28 10:05:03,412 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 10:05:03,413 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:05:03,484 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:05:03,484 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:05:03,484 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:96, output treesize:92 [2019-11-28 10:05:04,414 WARN L192 SmtUtils]: Spent 796.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 89 [2019-11-28 10:05:04,415 INFO L343 Elim1Store]: treesize reduction 322, result has 48.6 percent of original size [2019-11-28 10:05:04,416 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 10:05:04,417 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:05:04,692 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 45 [2019-11-28 10:05:04,693 INFO L588 ElimStorePlain]: treesize reduction 234, result has 30.4 percent of original size [2019-11-28 10:05:04,693 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:05:04,693 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:106, output treesize:102 [2019-11-28 10:05:05,229 WARN L192 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 48 [2019-11-28 10:05:05,230 INFO L343 Elim1Store]: treesize reduction 662, result has 10.8 percent of original size [2019-11-28 10:05:05,230 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 10:05:05,232 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:05:05,304 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:05:05,304 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:05:05,305 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:118, output treesize:114 [2019-11-28 10:05:06,553 WARN L192 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 289 DAG size of output: 109 [2019-11-28 10:05:06,555 INFO L343 Elim1Store]: treesize reduction 522, result has 42.3 percent of original size [2019-11-28 10:05:06,556 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 10:05:06,558 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:05:09,014 WARN L192 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 95 DAG size of output: 55 [2019-11-28 10:05:09,015 INFO L588 ElimStorePlain]: treesize reduction 294, result has 30.0 percent of original size [2019-11-28 10:05:09,015 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:05:09,015 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:130, output treesize:126 [2019-11-28 10:05:09,874 WARN L192 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 338 DAG size of output: 58 [2019-11-28 10:05:09,875 INFO L343 Elim1Store]: treesize reduction 942, result has 9.4 percent of original size [2019-11-28 10:05:09,876 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 10:05:09,877 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:05:09,968 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:05:09,968 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:05:09,968 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:140, output treesize:136 [2019-11-28 10:05:10,998 WARN L192 SmtUtils]: Spent 757.00 ms on a formula simplification. DAG size of input: 392 DAG size of output: 63 [2019-11-28 10:05:10,998 INFO L343 Elim1Store]: treesize reduction 1100, result has 8.9 percent of original size [2019-11-28 10:05:10,998 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 10:05:10,999 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:05:11,105 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-28 10:05:11,105 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:05:11,105 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:05:11,106 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:151, output treesize:147 [2019-11-28 10:05:11,358 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-28 10:05:13,300 WARN L192 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 451 DAG size of output: 139 [2019-11-28 10:05:13,301 INFO L343 Elim1Store]: treesize reduction 912, result has 35.4 percent of original size [2019-11-28 10:05:13,301 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 10:05:13,303 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:05:13,819 WARN L192 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 65 [2019-11-28 10:05:13,820 INFO L588 ElimStorePlain]: treesize reduction 384, result has 29.0 percent of original size [2019-11-28 10:05:13,820 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:05:13,821 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:161, output treesize:157 [2019-11-28 10:05:14,119 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-28 10:07:55,921 WARN L192 SmtUtils]: Spent 2.70 m on a formula simplification. DAG size of input: 513 DAG size of output: 196 [2019-11-28 10:07:55,921 INFO L343 Elim1Store]: treesize reduction 945, result has 41.7 percent of original size [2019-11-28 10:07:55,922 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 10:07:55,925 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:07:56,553 WARN L192 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 69 [2019-11-28 10:07:56,553 INFO L588 ElimStorePlain]: treesize reduction 384, result has 30.6 percent of original size [2019-11-28 10:07:56,554 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:07:56,554 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:173, output treesize:169 [2019-11-28 10:07:56,898 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-28 10:07:58,154 WARN L192 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 578 DAG size of output: 78 [2019-11-28 10:07:58,155 INFO L343 Elim1Store]: treesize reduction 1646, result has 7.5 percent of original size [2019-11-28 10:07:58,156 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 10:07:58,158 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:07:58,298 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-28 10:07:58,299 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:07:58,299 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:07:58,299 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:179, output treesize:175 [2019-11-28 10:07:58,719 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-28 10:08:01,838 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 10:08:01,887 INFO L588 ElimStorePlain]: treesize reduction 88, result has 32.3 percent of original size [2019-11-28 10:08:01,887 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 10:08:01,888 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:42 [2019-11-28 10:08:03,895 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 10:08:05,922 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 10:08:05,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,955 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,963 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,966 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,967 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,969 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,971 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,980 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:05,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,010 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,013 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,013 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,019 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,026 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,030 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,031 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,032 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,033 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,040 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,046 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,056 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,067 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,107 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,113 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:06,117 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:08:06,118 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 10:08:06,119 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:08:06,213 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:08:06,213 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 10:08:06,213 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:188, output treesize:114 [2019-11-28 10:08:10,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,902 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,906 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,907 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,908 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,929 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:08:10,946 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:08:10,947 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 10:08:10,948 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:08:11,014 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:08:11,014 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:08:11,014 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:138, output treesize:90 [2019-11-28 10:08:13,653 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:08:13,654 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 10:08:13,655 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:08:13,659 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:08:13,659 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 10:08:13,659 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:94, output treesize:3 [2019-11-28 10:08:14,263 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 10:08:14,263 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:08:16,311 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 10:08:16,327 INFO L588 ElimStorePlain]: treesize reduction 83, result has 24.5 percent of original size [2019-11-28 10:08:16,327 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 10:08:16,327 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:27 [2019-11-28 10:08:17,103 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 10:08:17,163 INFO L588 ElimStorePlain]: treesize reduction 82, result has 34.4 percent of original size [2019-11-28 10:08:17,164 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 10:08:17,164 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:69, output treesize:43 [2019-11-28 10:10:30,957 WARN L192 SmtUtils]: Spent 2.16 m on a formula simplification that was a NOOP. DAG size: 152 [2019-11-28 10:10:31,306 WARN L192 SmtUtils]: Spent 344.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-28 10:10:32,747 WARN L192 SmtUtils]: Spent 1.44 s on a formula simplification that was a NOOP. DAG size: 63 [2019-11-28 10:10:34,384 WARN L192 SmtUtils]: Spent 1.64 s on a formula simplification that was a NOOP. DAG size: 63 [2019-11-28 10:10:35,016 WARN L192 SmtUtils]: Spent 377.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-28 10:10:35,206 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-28 10:10:35,519 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-28 10:10:35,713 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-28 10:10:35,821 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-28 10:10:49,802 WARN L192 SmtUtils]: Spent 13.98 s on a formula simplification that was a NOOP. DAG size: 108 [2019-11-28 10:10:55,632 WARN L192 SmtUtils]: Spent 5.83 s on a formula simplification that was a NOOP. DAG size: 74 [2019-11-28 10:11:03,424 WARN L192 SmtUtils]: Spent 7.79 s on a formula simplification that was a NOOP. DAG size: 78 [2019-11-28 10:11:11,022 WARN L192 SmtUtils]: Spent 7.60 s on a formula simplification that was a NOOP. DAG size: 78 [2019-11-28 10:11:12,271 WARN L192 SmtUtils]: Spent 391.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-28 10:11:12,449 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-28 10:11:12,550 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-28 10:11:12,687 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-28 10:11:12,895 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-28 10:11:12,999 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 10:11:13,008 INFO L588 ElimStorePlain]: treesize reduction 91, result has 31.1 percent of original size [2019-11-28 10:11:13,009 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 10:11:13,009 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:41 [2019-11-28 10:11:14,349 WARN L192 SmtUtils]: Spent 483.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-28 10:11:14,639 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-28 10:11:14,795 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-28 10:11:14,801 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 10:11:14,881 INFO L588 ElimStorePlain]: treesize reduction 90, result has 37.9 percent of original size [2019-11-28 10:11:14,882 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 10:11:14,882 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:88, output treesize:55 [2019-11-28 10:11:15,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:11:15,578 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 10:11:15,579 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:11:15,611 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:11:15,813 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-11-28 10:11:15,814 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 10:11:15,822 INFO L168 Benchmark]: Toolchain (without parser) took 455862.60 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 409.5 MB). Free memory was 946.9 MB in the beginning and 1.3 GB in the end (delta: -325.6 MB). Peak memory consumption was 83.9 MB. Max. memory is 11.5 GB. [2019-11-28 10:11:15,822 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 10:11:15,823 INFO L168 Benchmark]: CACSL2BoogieTranslator took 820.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -154.4 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-28 10:11:15,823 INFO L168 Benchmark]: Boogie Preprocessor took 127.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 10:11:15,823 INFO L168 Benchmark]: RCFGBuilder took 1458.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 990.3 MB in the end (delta: 104.5 MB). Peak memory consumption was 104.5 MB. Max. memory is 11.5 GB. [2019-11-28 10:11:15,824 INFO L168 Benchmark]: TraceAbstraction took 453450.27 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 263.2 MB). Free memory was 990.3 MB in the beginning and 1.3 GB in the end (delta: -282.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 10:11:15,826 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 820.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -154.4 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 127.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1458.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 990.3 MB in the end (delta: 104.5 MB). Peak memory consumption was 104.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 453450.27 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 263.2 MB). Free memory was 990.3 MB in the beginning and 1.3 GB in the end (delta: -282.3 MB). There was no memory consumed. 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...