./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f4d5612c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.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 e977fbeb632c2e5a16902a6c2250cf608217c650 ............................................................................................................................ 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_3-2.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 e977fbeb632c2e5a16902a6c2250cf608217c650 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported: (forall ((|v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4| (_ BitVec 32))) (exists ((v_DerPreprocessor_18 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (v_DerPreprocessor_19 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32))) (or (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|)) (not (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base| (let ((.cse0 (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv4 32)))) (store (store (store (store (store (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv12 32)) v_DerPreprocessor_17) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv13 32)) v_DerPreprocessor_18) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv14 32)) v_DerPreprocessor_19) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv15 32)) v_DerPreprocessor_20) .cse0 .cse0) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv8 32)) .cse0))) |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|)))))) --- Real Ultimate output --- This is Ultimate 0.1.24-f4d5612 [2019-11-28 12:41:58,562 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 12:41:58,566 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 12:41:58,585 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 12:41:58,586 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 12:41:58,588 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 12:41:58,590 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 12:41:58,600 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 12:41:58,606 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 12:41:58,610 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 12:41:58,612 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 12:41:58,614 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 12:41:58,614 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 12:41:58,618 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 12:41:58,619 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 12:41:58,621 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 12:41:58,623 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 12:41:58,624 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 12:41:58,627 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 12:41:58,631 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 12:41:58,635 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 12:41:58,640 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 12:41:58,642 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 12:41:58,643 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 12:41:58,646 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 12:41:58,647 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 12:41:58,647 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 12:41:58,649 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 12:41:58,650 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 12:41:58,651 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 12:41:58,651 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 12:41:58,652 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 12:41:58,653 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 12:41:58,654 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 12:41:58,655 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 12:41:58,656 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 12:41:58,657 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 12:41:58,657 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 12:41:58,658 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 12:41:58,659 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 12:41:58,660 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 12:41:58,661 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-28 12:41:58,697 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 12:41:58,699 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 12:41:58,700 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 12:41:58,702 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 12:41:58,705 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 12:41:58,705 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 12:41:58,706 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 12:41:58,706 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 12:41:58,706 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 12:41:58,706 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 12:41:58,707 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 12:41:58,707 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 12:41:58,707 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 12:41:58,708 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 12:41:58,709 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 12:41:58,709 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 12:41:58,709 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 12:41:58,711 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 12:41:58,711 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 12:41:58,712 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 12:41:58,712 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 12:41:58,712 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 12:41:58,713 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 12:41:58,713 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 12:41:58,713 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 12:41:58,714 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 12:41:58,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 12:41:58,714 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 -> e977fbeb632c2e5a16902a6c2250cf608217c650 [2019-11-28 12:41:59,028 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 12:41:59,042 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 12:41:59,046 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 12:41:59,048 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 12:41:59,048 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 12:41:59,049 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i [2019-11-28 12:41:59,123 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d53b1801/fea16cc1696845359d3c4c4c8888104d/FLAG39a52107c [2019-11-28 12:41:59,702 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 12:41:59,702 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i [2019-11-28 12:41:59,718 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d53b1801/fea16cc1696845359d3c4c4c8888104d/FLAG39a52107c [2019-11-28 12:41:59,968 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d53b1801/fea16cc1696845359d3c4c4c8888104d [2019-11-28 12:41:59,972 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 12:41:59,974 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 12:41:59,975 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 12:41:59,975 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 12:41:59,979 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 12:41:59,980 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:41:59" (1/1) ... [2019-11-28 12:41:59,983 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14170d03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:41:59, skipping insertion in model container [2019-11-28 12:41:59,984 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:41:59" (1/1) ... [2019-11-28 12:41:59,992 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 12:42:00,062 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 12:42:00,563 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 12:42:00,586 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2019-11-28 12:42:00,586 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@54652950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:42:00, skipping insertion in model container [2019-11-28 12:42:00,587 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 12:42:00,587 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-11-28 12:42:00,590 INFO L168 Benchmark]: Toolchain (without parser) took 615.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -137.9 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-28 12:42:00,590 INFO L168 Benchmark]: CDTParser took 1.40 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 12:42:00,591 INFO L168 Benchmark]: CACSL2BoogieTranslator took 612.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -143.3 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2019-11-28 12:42:00,594 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.40 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 612.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -143.3 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-f4d5612 [2019-11-28 12:42:02,336 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 12:42:02,338 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 12:42:02,356 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 12:42:02,357 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 12:42:02,359 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 12:42:02,361 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 12:42:02,371 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 12:42:02,377 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 12:42:02,380 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 12:42:02,381 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 12:42:02,383 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 12:42:02,384 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 12:42:02,387 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 12:42:02,388 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 12:42:02,389 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 12:42:02,391 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 12:42:02,392 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 12:42:02,395 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 12:42:02,399 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 12:42:02,404 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 12:42:02,408 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 12:42:02,410 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 12:42:02,411 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 12:42:02,415 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 12:42:02,416 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 12:42:02,416 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 12:42:02,418 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 12:42:02,419 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 12:42:02,420 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 12:42:02,420 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 12:42:02,421 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 12:42:02,421 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 12:42:02,423 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 12:42:02,424 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 12:42:02,424 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 12:42:02,425 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 12:42:02,425 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 12:42:02,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 12:42:02,427 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 12:42:02,428 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 12:42:02,429 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-28 12:42:02,466 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 12:42:02,466 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 12:42:02,468 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 12:42:02,470 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 12:42:02,470 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 12:42:02,470 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 12:42:02,472 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 12:42:02,472 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 12:42:02,472 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 12:42:02,474 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 12:42:02,474 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 12:42:02,474 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 12:42:02,475 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 12:42:02,476 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 12:42:02,476 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 12:42:02,476 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 12:42:02,477 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-28 12:42:02,480 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-28 12:42:02,480 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 12:42:02,480 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 12:42:02,481 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 12:42:02,481 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 12:42:02,481 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 12:42:02,482 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 12:42:02,482 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 12:42:02,482 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 12:42:02,483 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 12:42:02,483 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-28 12:42:02,484 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-28 12:42:02,484 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-28 12:42:02,484 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 -> e977fbeb632c2e5a16902a6c2250cf608217c650 [2019-11-28 12:42:02,803 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 12:42:02,821 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 12:42:02,824 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 12:42:02,827 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 12:42:02,828 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 12:42:02,829 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i [2019-11-28 12:42:02,904 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/439864bc9/6dbe0f031712471d8337bb99cc5901dd/FLAG4c5bccd45 [2019-11-28 12:42:03,467 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 12:42:03,469 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i [2019-11-28 12:42:03,501 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/439864bc9/6dbe0f031712471d8337bb99cc5901dd/FLAG4c5bccd45 [2019-11-28 12:42:03,740 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/439864bc9/6dbe0f031712471d8337bb99cc5901dd [2019-11-28 12:42:03,744 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 12:42:03,746 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 12:42:03,751 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 12:42:03,751 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 12:42:03,755 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 12:42:03,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:42:03" (1/1) ... [2019-11-28 12:42:03,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72ad7dbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:42:03, skipping insertion in model container [2019-11-28 12:42:03,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:42:03" (1/1) ... [2019-11-28 12:42:03,770 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 12:42:03,837 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 12:42:04,384 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 12:42:04,407 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-28 12:42:04,429 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 12:42:04,476 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 12:42:04,490 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 12:42:04,585 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 12:42:04,698 INFO L208 MainTranslator]: Completed translation [2019-11-28 12:42:04,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:42:04 WrapperNode [2019-11-28 12:42:04,701 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 12:42:04,702 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 12:42:04,702 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 12:42:04,702 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 12:42:04,714 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:42:04" (1/1) ... [2019-11-28 12:42:04,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:42:04" (1/1) ... [2019-11-28 12:42:04,741 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:42:04" (1/1) ... [2019-11-28 12:42:04,744 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:42:04" (1/1) ... [2019-11-28 12:42:04,797 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:42:04" (1/1) ... [2019-11-28 12:42:04,804 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:42:04" (1/1) ... [2019-11-28 12:42:04,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:42:04" (1/1) ... [2019-11-28 12:42:04,822 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 12:42:04,823 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 12:42:04,823 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 12:42:04,824 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 12:42:04,825 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:42:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 12:42:04,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 12:42:04,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 12:42:04,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-28 12:42:04,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-28 12:42:04,889 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-28 12:42:04,889 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-28 12:42:04,889 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-28 12:42:04,889 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-28 12:42:04,890 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-28 12:42:04,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-28 12:42:04,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-28 12:42:04,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-28 12:42:04,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-28 12:42:04,891 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-28 12:42:04,891 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-28 12:42:04,891 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-28 12:42:04,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-28 12:42:04,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-28 12:42:04,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-28 12:42:04,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-28 12:42:04,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-28 12:42:04,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-28 12:42:04,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-28 12:42:04,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-28 12:42:04,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-28 12:42:04,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-28 12:42:04,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-28 12:42:04,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-28 12:42:04,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-28 12:42:04,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-28 12:42:04,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-28 12:42:04,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-28 12:42:04,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-28 12:42:04,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-28 12:42:04,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-28 12:42:04,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-28 12:42:04,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-28 12:42:04,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-28 12:42:04,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-28 12:42:04,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-28 12:42:04,897 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-28 12:42:04,897 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-28 12:42:04,898 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-28 12:42:04,898 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 12:42:04,898 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-28 12:42:04,898 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-28 12:42:04,898 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-28 12:42:04,899 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-28 12:42:04,899 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-28 12:42:04,899 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-28 12:42:04,899 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-28 12:42:04,900 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-28 12:42:04,900 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-28 12:42:04,900 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-28 12:42:04,900 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-28 12:42:04,900 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-28 12:42:04,901 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-28 12:42:04,901 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-28 12:42:04,901 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-28 12:42:04,901 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-28 12:42:04,901 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-28 12:42:04,902 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-28 12:42:04,902 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-28 12:42:04,902 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-28 12:42:04,902 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-28 12:42:04,902 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-28 12:42:04,903 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-28 12:42:04,903 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-28 12:42:04,903 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-28 12:42:04,903 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-28 12:42:04,903 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-28 12:42:04,904 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-28 12:42:04,904 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-28 12:42:04,904 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-28 12:42:04,904 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-28 12:42:04,905 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-28 12:42:04,905 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-28 12:42:04,905 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-28 12:42:04,905 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-28 12:42:04,905 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-28 12:42:04,906 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-28 12:42:04,906 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-28 12:42:04,906 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-28 12:42:04,906 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-28 12:42:04,906 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-28 12:42:04,907 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-28 12:42:04,907 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-28 12:42:04,907 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-28 12:42:04,907 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-28 12:42:04,907 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-28 12:42:04,908 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-28 12:42:04,908 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-28 12:42:04,908 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-28 12:42:04,908 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-28 12:42:04,908 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-28 12:42:04,908 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-28 12:42:04,909 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-28 12:42:04,909 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-28 12:42:04,909 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-28 12:42:04,909 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-28 12:42:04,909 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-28 12:42:04,910 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-28 12:42:04,910 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-28 12:42:04,910 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 12:42:04,910 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-28 12:42:04,910 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 12:42:04,911 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-28 12:42:04,911 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-28 12:42:04,911 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-28 12:42:04,911 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-28 12:42:04,911 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-28 12:42:04,912 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-28 12:42:04,912 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-28 12:42:04,912 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-28 12:42:04,912 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-28 12:42:04,912 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-28 12:42:04,912 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-28 12:42:04,913 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-28 12:42:04,913 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-28 12:42:04,913 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-28 12:42:04,913 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-28 12:42:04,913 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-28 12:42:04,914 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-28 12:42:04,914 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-28 12:42:04,914 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-28 12:42:04,914 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-28 12:42:04,915 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-28 12:42:04,915 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-28 12:42:04,915 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-28 12:42:04,915 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-28 12:42:04,915 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-28 12:42:04,916 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-28 12:42:04,916 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-28 12:42:04,916 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-28 12:42:04,916 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-28 12:42:04,916 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-28 12:42:04,917 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-28 12:42:04,917 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-28 12:42:04,917 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-28 12:42:04,917 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-28 12:42:04,917 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-28 12:42:04,918 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-28 12:42:04,918 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-28 12:42:04,918 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-28 12:42:04,918 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-28 12:42:04,919 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-28 12:42:04,919 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-28 12:42:04,919 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-28 12:42:04,919 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-28 12:42:04,919 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-28 12:42:04,920 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-28 12:42:04,920 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-28 12:42:04,920 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-28 12:42:04,920 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-28 12:42:04,920 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-28 12:42:04,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 12:42:04,921 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-28 12:42:04,921 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-28 12:42:04,921 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-28 12:42:04,921 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-28 12:42:04,921 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-28 12:42:04,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 12:42:04,922 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-28 12:42:04,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-28 12:42:04,922 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-28 12:42:04,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 12:42:04,923 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-28 12:42:04,923 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-28 12:42:04,923 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-28 12:42:04,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 12:42:04,923 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-28 12:42:04,923 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-28 12:42:04,924 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-28 12:42:04,924 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-28 12:42:04,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-28 12:42:04,924 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-28 12:42:04,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 12:42:04,925 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-28 12:42:04,925 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-28 12:42:04,925 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-28 12:42:04,925 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-28 12:42:04,925 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-28 12:42:04,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-28 12:42:04,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-28 12:42:04,926 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-28 12:42:04,926 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-28 12:42:04,926 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-28 12:42:04,926 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-28 12:42:04,927 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-28 12:42:04,927 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-28 12:42:04,927 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-28 12:42:04,927 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-28 12:42:04,927 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-28 12:42:04,928 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-28 12:42:04,928 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-28 12:42:04,928 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-28 12:42:04,928 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-28 12:42:04,928 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-28 12:42:04,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-28 12:42:04,929 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-28 12:42:04,929 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-28 12:42:04,929 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-28 12:42:04,929 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 12:42:04,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 12:42:04,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 12:42:04,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-28 12:42:04,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 12:42:04,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-28 12:42:04,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-28 12:42:04,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-28 12:42:04,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-28 12:42:04,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-28 12:42:05,575 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 12:42:06,014 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 12:42:06,383 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 12:42:06,384 INFO L287 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-28 12:42:06,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:42:06 BoogieIcfgContainer [2019-11-28 12:42:06,386 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 12:42:06,388 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 12:42:06,388 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 12:42:06,392 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 12:42:06,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:42:03" (1/3) ... [2019-11-28 12:42:06,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6beafc99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:42:06, skipping insertion in model container [2019-11-28 12:42:06,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:42:04" (2/3) ... [2019-11-28 12:42:06,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6beafc99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:42:06, skipping insertion in model container [2019-11-28 12:42:06,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:42:06" (3/3) ... [2019-11-28 12:42:06,398 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test22_3-2.i [2019-11-28 12:42:06,410 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 12:42:06,423 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2019-11-28 12:42:06,438 INFO L249 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2019-11-28 12:42:06,470 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 12:42:06,471 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 12:42:06,471 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 12:42:06,471 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 12:42:06,471 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 12:42:06,472 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 12:42:06,472 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 12:42:06,472 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 12:42:06,502 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2019-11-28 12:42:06,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 12:42:06,516 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:42:06,517 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:42:06,518 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:42:06,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:42:06,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1484999723, now seen corresponding path program 1 times [2019-11-28 12:42:06,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:42:06,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1659084536] [2019-11-28 12:42:06,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-28 12:42:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:42:06,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 12:42:06,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:42:06,861 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 12:42:06,865 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:42:06,874 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:42:06,875 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:42:06,875 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 12:42:06,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:42:06,907 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:42:06,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:42:06,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1659084536] [2019-11-28 12:42:06,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:42:06,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-28 12:42:06,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660340892] [2019-11-28 12:42:06,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 12:42:06,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:42:06,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 12:42:06,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 12:42:06,988 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 5 states. [2019-11-28 12:42:07,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:42:07,296 INFO L93 Difference]: Finished difference Result 133 states and 144 transitions. [2019-11-28 12:42:07,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 12:42:07,300 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-28 12:42:07,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:42:07,322 INFO L225 Difference]: With dead ends: 133 [2019-11-28 12:42:07,322 INFO L226 Difference]: Without dead ends: 130 [2019-11-28 12:42:07,340 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 12:42:07,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-28 12:42:07,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 124. [2019-11-28 12:42:07,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-28 12:42:07,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2019-11-28 12:42:07,439 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 17 [2019-11-28 12:42:07,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:42:07,439 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2019-11-28 12:42:07,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 12:42:07,440 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2019-11-28 12:42:07,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 12:42:07,441 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:42:07,441 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:42:07,645 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-28 12:42:07,647 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:42:07,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:42:07,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1484999724, now seen corresponding path program 1 times [2019-11-28 12:42:07,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:42:07,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1985252878] [2019-11-28 12:42:07,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-28 12:42:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:42:07,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 12:42:07,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:42:07,834 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 12:42:07,835 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:42:07,841 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:42:07,841 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:42:07,842 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 12:42:07,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:42:07,895 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:42:08,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:42:08,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1985252878] [2019-11-28 12:42:08,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:42:08,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-28 12:42:08,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248896400] [2019-11-28 12:42:08,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 12:42:08,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:42:08,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 12:42:08,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-28 12:42:08,219 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand 10 states. [2019-11-28 12:42:08,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:42:08,848 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2019-11-28 12:42:08,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 12:42:08,851 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-28 12:42:08,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:42:08,854 INFO L225 Difference]: With dead ends: 129 [2019-11-28 12:42:08,854 INFO L226 Difference]: Without dead ends: 129 [2019-11-28 12:42:08,856 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-28 12:42:08,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-28 12:42:08,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 124. [2019-11-28 12:42:08,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-28 12:42:08,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2019-11-28 12:42:08,867 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 17 [2019-11-28 12:42:08,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:42:08,868 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2019-11-28 12:42:08,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 12:42:08,868 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2019-11-28 12:42:08,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 12:42:08,869 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:42:08,869 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:42:09,069 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-28 12:42:09,071 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:42:09,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:42:09,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1513628874, now seen corresponding path program 1 times [2019-11-28 12:42:09,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:42:09,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [755324508] [2019-11-28 12:42:09,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-28 12:42:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:42:09,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 12:42:09,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:42:09,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:42:09,231 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:42:09,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:42:09,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [755324508] [2019-11-28 12:42:09,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:42:09,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-28 12:42:09,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694669118] [2019-11-28 12:42:09,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 12:42:09,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:42:09,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 12:42:09,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 12:42:09,287 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 5 states. [2019-11-28 12:42:09,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:42:09,319 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2019-11-28 12:42:09,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 12:42:09,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-28 12:42:09,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:42:09,322 INFO L225 Difference]: With dead ends: 123 [2019-11-28 12:42:09,325 INFO L226 Difference]: Without dead ends: 123 [2019-11-28 12:42:09,325 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 12:42:09,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-28 12:42:09,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2019-11-28 12:42:09,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-28 12:42:09,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2019-11-28 12:42:09,345 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 17 [2019-11-28 12:42:09,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:42:09,345 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2019-11-28 12:42:09,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 12:42:09,346 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2019-11-28 12:42:09,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 12:42:09,348 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:42:09,349 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] [2019-11-28 12:42:09,557 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-28 12:42:09,558 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:42:09,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:42:09,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1578542280, now seen corresponding path program 1 times [2019-11-28 12:42:09,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:42:09,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [513502368] [2019-11-28 12:42:09,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-28 12:42:09,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:42:09,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 12:42:09,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:42:09,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:42:09,742 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:42:09,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:42:09,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [513502368] [2019-11-28 12:42:09,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:42:09,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-28 12:42:09,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715660776] [2019-11-28 12:42:09,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 12:42:09,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:42:09,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 12:42:09,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 12:42:09,815 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand 5 states. [2019-11-28 12:42:09,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:42:09,852 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2019-11-28 12:42:09,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 12:42:09,853 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-28 12:42:09,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:42:09,854 INFO L225 Difference]: With dead ends: 123 [2019-11-28 12:42:09,855 INFO L226 Difference]: Without dead ends: 123 [2019-11-28 12:42:09,855 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 12:42:09,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-28 12:42:09,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2019-11-28 12:42:09,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-28 12:42:09,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2019-11-28 12:42:09,873 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 29 [2019-11-28 12:42:09,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:42:09,874 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2019-11-28 12:42:09,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 12:42:09,874 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2019-11-28 12:42:09,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 12:42:09,876 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:42:09,876 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] [2019-11-28 12:42:10,088 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-28 12:42:10,089 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:42:10,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:42:10,090 INFO L82 PathProgramCache]: Analyzing trace with hash 581469927, now seen corresponding path program 1 times [2019-11-28 12:42:10,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:42:10,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [813942732] [2019-11-28 12:42:10,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-28 12:42:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:42:10,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 12:42:10,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:42:10,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:42:10,338 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:42:10,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:42:10,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [813942732] [2019-11-28 12:42:10,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:42:10,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2019-11-28 12:42:10,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253099930] [2019-11-28 12:42:10,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 12:42:10,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:42:10,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 12:42:10,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 12:42:10,409 INFO L87 Difference]: Start difference. First operand 121 states and 128 transitions. Second operand 7 states. [2019-11-28 12:42:10,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:42:10,495 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2019-11-28 12:42:10,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 12:42:10,497 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2019-11-28 12:42:10,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:42:10,498 INFO L225 Difference]: With dead ends: 134 [2019-11-28 12:42:10,498 INFO L226 Difference]: Without dead ends: 134 [2019-11-28 12:42:10,502 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 12:42:10,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-28 12:42:10,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2019-11-28 12:42:10,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-28 12:42:10,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2019-11-28 12:42:10,523 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 29 [2019-11-28 12:42:10,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:42:10,523 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2019-11-28 12:42:10,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 12:42:10,523 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2019-11-28 12:42:10,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 12:42:10,525 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:42:10,525 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:42:10,744 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-28 12:42:10,744 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:42:10,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:42:10,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1899216601, now seen corresponding path program 1 times [2019-11-28 12:42:10,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:42:10,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [888961188] [2019-11-28 12:42:10,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-28 12:42:10,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:42:10,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 12:42:10,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:42:10,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:42:10,901 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:42:10,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:42:10,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [888961188] [2019-11-28 12:42:10,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:42:10,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-28 12:42:10,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073990028] [2019-11-28 12:42:10,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 12:42:10,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:42:10,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 12:42:10,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 12:42:10,956 INFO L87 Difference]: Start difference. First operand 130 states and 138 transitions. Second operand 6 states. [2019-11-28 12:42:11,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:42:11,007 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2019-11-28 12:42:11,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 12:42:11,008 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-28 12:42:11,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:42:11,009 INFO L225 Difference]: With dead ends: 136 [2019-11-28 12:42:11,010 INFO L226 Difference]: Without dead ends: 132 [2019-11-28 12:42:11,010 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-28 12:42:11,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-28 12:42:11,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-11-28 12:42:11,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-28 12:42:11,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 140 transitions. [2019-11-28 12:42:11,023 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 140 transitions. Word has length 32 [2019-11-28 12:42:11,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:42:11,024 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 140 transitions. [2019-11-28 12:42:11,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 12:42:11,024 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 140 transitions. [2019-11-28 12:42:11,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 12:42:11,030 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:42:11,030 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:42:11,243 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-28 12:42:11,244 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:42:11,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:42:11,244 INFO L82 PathProgramCache]: Analyzing trace with hash -2034413241, now seen corresponding path program 1 times [2019-11-28 12:42:11,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:42:11,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1672672853] [2019-11-28 12:42:11,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-28 12:42:11,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:42:11,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 12:42:11,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:42:11,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:42:11,430 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:42:11,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:42:11,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1672672853] [2019-11-28 12:42:11,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 12:42:11,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-28 12:42:11,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357961067] [2019-11-28 12:42:11,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 12:42:11,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:42:11,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 12:42:11,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-28 12:42:11,559 INFO L87 Difference]: Start difference. First operand 132 states and 140 transitions. Second operand 10 states. [2019-11-28 12:42:11,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:42:11,768 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2019-11-28 12:42:11,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 12:42:11,769 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-11-28 12:42:11,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:42:11,771 INFO L225 Difference]: With dead ends: 140 [2019-11-28 12:42:11,771 INFO L226 Difference]: Without dead ends: 136 [2019-11-28 12:42:11,772 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-11-28 12:42:11,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-11-28 12:42:11,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-11-28 12:42:11,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-28 12:42:11,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 144 transitions. [2019-11-28 12:42:11,780 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 144 transitions. Word has length 34 [2019-11-28 12:42:11,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:42:11,780 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 144 transitions. [2019-11-28 12:42:11,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 12:42:11,781 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 144 transitions. [2019-11-28 12:42:11,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 12:42:11,782 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:42:11,782 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] [2019-11-28 12:42:11,993 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-28 12:42:11,994 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:42:11,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:42:11,995 INFO L82 PathProgramCache]: Analyzing trace with hash 76391075, now seen corresponding path program 1 times [2019-11-28 12:42:11,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:42:11,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [607391757] [2019-11-28 12:42:11,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-28 12:42:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:42:12,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 12:42:12,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:42:12,185 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 12:42:12,186 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:42:12,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 12:42:12,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [607391757] [2019-11-28 12:42:12,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:42:12,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-28 12:42:12,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104845061] [2019-11-28 12:42:12,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 12:42:12,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:42:12,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 12:42:12,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 12:42:12,345 INFO L87 Difference]: Start difference. First operand 136 states and 144 transitions. Second operand 3 states. [2019-11-28 12:42:12,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:42:12,531 INFO L93 Difference]: Finished difference Result 147 states and 155 transitions. [2019-11-28 12:42:12,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 12:42:12,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-28 12:42:12,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:42:12,532 INFO L225 Difference]: With dead ends: 147 [2019-11-28 12:42:12,533 INFO L226 Difference]: Without dead ends: 131 [2019-11-28 12:42:12,533 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 12:42:12,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-28 12:42:12,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2019-11-28 12:42:12,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-28 12:42:12,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2019-11-28 12:42:12,542 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 32 [2019-11-28 12:42:12,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:42:12,542 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2019-11-28 12:42:12,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 12:42:12,542 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2019-11-28 12:42:12,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-28 12:42:12,546 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:42:12,546 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:42:12,747 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-28 12:42:12,747 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:42:12,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:42:12,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1051272825, now seen corresponding path program 2 times [2019-11-28 12:42:12,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:42:12,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [293127833] [2019-11-28 12:42:12,750 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-28 12:42:12,885 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 12:42:12,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 12:42:12,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 12:42:12,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:42:12,897 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 12:42:12,898 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:42:12,900 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:42:12,900 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:42:12,901 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 12:42:13,071 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-28 12:42:13,071 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:42:13,148 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-28 12:42:13,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [293127833] [2019-11-28 12:42:13,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:42:13,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-28 12:42:13,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979231849] [2019-11-28 12:42:13,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 12:42:13,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:42:13,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 12:42:13,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-28 12:42:13,151 INFO L87 Difference]: Start difference. First operand 123 states and 129 transitions. Second operand 12 states. [2019-11-28 12:42:14,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:42:14,080 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2019-11-28 12:42:14,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 12:42:14,082 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-11-28 12:42:14,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:42:14,084 INFO L225 Difference]: With dead ends: 146 [2019-11-28 12:42:14,084 INFO L226 Difference]: Without dead ends: 146 [2019-11-28 12:42:14,085 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-28 12:42:14,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-28 12:42:14,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 122. [2019-11-28 12:42:14,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-28 12:42:14,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 128 transitions. [2019-11-28 12:42:14,092 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 128 transitions. Word has length 38 [2019-11-28 12:42:14,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:42:14,093 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 128 transitions. [2019-11-28 12:42:14,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 12:42:14,093 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2019-11-28 12:42:14,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-28 12:42:14,094 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:42:14,094 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:42:14,309 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-28 12:42:14,309 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:42:14,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:42:14,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1051272824, now seen corresponding path program 1 times [2019-11-28 12:42:14,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:42:14,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234203139] [2019-11-28 12:42:14,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-28 12:42:14,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:42:14,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 12:42:14,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:42:14,536 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:42:14,537 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:42:14,873 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:42:14,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [234203139] [2019-11-28 12:42:14,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 12:42:14,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-28 12:42:14,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708880257] [2019-11-28 12:42:14,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 12:42:14,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:42:14,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 12:42:14,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-11-28 12:42:14,875 INFO L87 Difference]: Start difference. First operand 122 states and 128 transitions. Second operand 18 states. [2019-11-28 12:42:15,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:42:15,778 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2019-11-28 12:42:15,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 12:42:15,780 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2019-11-28 12:42:15,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:42:15,781 INFO L225 Difference]: With dead ends: 134 [2019-11-28 12:42:15,781 INFO L226 Difference]: Without dead ends: 130 [2019-11-28 12:42:15,782 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=223, Invalid=377, Unknown=0, NotChecked=0, Total=600 [2019-11-28 12:42:15,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-28 12:42:15,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-11-28 12:42:15,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-28 12:42:15,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 136 transitions. [2019-11-28 12:42:15,790 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 136 transitions. Word has length 38 [2019-11-28 12:42:15,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:42:15,792 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 136 transitions. [2019-11-28 12:42:15,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 12:42:15,792 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2019-11-28 12:42:15,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-28 12:42:15,794 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:42:15,794 INFO L410 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:42:15,995 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-28 12:42:15,995 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:42:15,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:42:15,996 INFO L82 PathProgramCache]: Analyzing trace with hash -2061530616, now seen corresponding path program 2 times [2019-11-28 12:42:15,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:42:15,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1795603845] [2019-11-28 12:42:15,998 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-11-28 12:42:16,141 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 12:42:16,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 12:42:16,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 12:42:16,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:42:16,165 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 12:42:16,165 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:42:16,173 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:42:16,173 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:42:16,173 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 12:42:16,401 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-28 12:42:16,402 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:42:17,372 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-28 12:42:17,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1795603845] [2019-11-28 12:42:17,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:42:17,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-28 12:42:17,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397299647] [2019-11-28 12:42:17,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-28 12:42:17,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:42:17,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-28 12:42:17,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-28 12:42:17,374 INFO L87 Difference]: Start difference. First operand 130 states and 136 transitions. Second operand 23 states. [2019-11-28 12:42:19,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:42:19,810 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2019-11-28 12:42:19,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 12:42:19,812 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2019-11-28 12:42:19,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:42:19,813 INFO L225 Difference]: With dead ends: 129 [2019-11-28 12:42:19,813 INFO L226 Difference]: Without dead ends: 129 [2019-11-28 12:42:19,814 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-11-28 12:42:19,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-28 12:42:19,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-11-28 12:42:19,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-28 12:42:19,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions. [2019-11-28 12:42:19,819 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 46 [2019-11-28 12:42:19,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:42:19,820 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions. [2019-11-28 12:42:19,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-28 12:42:19,820 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2019-11-28 12:42:19,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 12:42:19,821 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:42:19,821 INFO L410 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:42:20,031 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-28 12:42:20,032 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:42:20,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:42:20,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1631731192, now seen corresponding path program 1 times [2019-11-28 12:42:20,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:42:20,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1004742770] [2019-11-28 12:42:20,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-11-28 12:42:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:42:20,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-28 12:42:20,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:42:20,409 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:42:20,409 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:42:21,294 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:42:21,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1004742770] [2019-11-28 12:42:21,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 12:42:21,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2019-11-28 12:42:21,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040778344] [2019-11-28 12:42:21,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-28 12:42:21,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:42:21,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-28 12:42:21,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2019-11-28 12:42:21,297 INFO L87 Difference]: Start difference. First operand 129 states and 135 transitions. Second operand 34 states. [2019-11-28 12:42:22,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:42:22,058 INFO L93 Difference]: Finished difference Result 135 states and 141 transitions. [2019-11-28 12:42:22,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 12:42:22,059 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 51 [2019-11-28 12:42:22,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:42:22,060 INFO L225 Difference]: With dead ends: 135 [2019-11-28 12:42:22,060 INFO L226 Difference]: Without dead ends: 131 [2019-11-28 12:42:22,061 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=250, Invalid=940, Unknown=0, NotChecked=0, Total=1190 [2019-11-28 12:42:22,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-28 12:42:22,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-11-28 12:42:22,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-28 12:42:22,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 137 transitions. [2019-11-28 12:42:22,065 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 137 transitions. Word has length 51 [2019-11-28 12:42:22,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:42:22,065 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 137 transitions. [2019-11-28 12:42:22,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-28 12:42:22,066 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 137 transitions. [2019-11-28 12:42:22,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 12:42:22,066 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:42:22,066 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:42:22,269 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-28 12:42:22,269 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:42:22,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:42:22,270 INFO L82 PathProgramCache]: Analyzing trace with hash -346949160, now seen corresponding path program 2 times [2019-11-28 12:42:22,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:42:22,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1505130305] [2019-11-28 12:42:22,276 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-11-28 12:42:22,409 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 12:42:22,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 12:42:22,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 12:42:22,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:42:22,428 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 12:42:22,428 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:42:22,431 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:42:22,431 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:42:22,432 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 12:42:22,598 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 12:42:22,598 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:42:22,668 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 12:42:22,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1505130305] [2019-11-28 12:42:22,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:42:22,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-28 12:42:22,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673376744] [2019-11-28 12:42:22,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 12:42:22,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:42:22,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 12:42:22,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-28 12:42:22,670 INFO L87 Difference]: Start difference. First operand 131 states and 137 transitions. Second operand 12 states. [2019-11-28 12:42:23,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:42:23,489 INFO L93 Difference]: Finished difference Result 153 states and 167 transitions. [2019-11-28 12:42:23,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 12:42:23,490 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-11-28 12:42:23,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:42:23,491 INFO L225 Difference]: With dead ends: 153 [2019-11-28 12:42:23,491 INFO L226 Difference]: Without dead ends: 153 [2019-11-28 12:42:23,492 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 12:42:23,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-28 12:42:23,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 129. [2019-11-28 12:42:23,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-28 12:42:23,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions. [2019-11-28 12:42:23,499 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 53 [2019-11-28 12:42:23,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:42:23,499 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions. [2019-11-28 12:42:23,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 12:42:23,500 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2019-11-28 12:42:23,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 12:42:23,500 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:42:23,501 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:42:23,707 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-28 12:42:23,708 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:42:23,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:42:23,708 INFO L82 PathProgramCache]: Analyzing trace with hash -346949159, now seen corresponding path program 1 times [2019-11-28 12:42:23,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:42:23,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2125265541] [2019-11-28 12:42:23,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-11-28 12:42:23,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:42:23,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 12:42:23,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:42:23,902 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 12:42:23,902 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:42:23,907 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:42:23,908 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:42:23,908 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 12:42:24,172 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 12:42:24,172 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:42:24,947 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 12:42:24,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2125265541] [2019-11-28 12:42:24,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:42:24,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-28 12:42:24,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398979762] [2019-11-28 12:42:24,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-28 12:42:24,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:42:24,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-28 12:42:24,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-28 12:42:24,950 INFO L87 Difference]: Start difference. First operand 129 states and 135 transitions. Second operand 23 states. [2019-11-28 12:42:26,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:42:26,976 INFO L93 Difference]: Finished difference Result 127 states and 133 transitions. [2019-11-28 12:42:26,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 12:42:26,976 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2019-11-28 12:42:26,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:42:26,977 INFO L225 Difference]: With dead ends: 127 [2019-11-28 12:42:26,978 INFO L226 Difference]: Without dead ends: 127 [2019-11-28 12:42:26,978 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 80 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-11-28 12:42:26,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-28 12:42:26,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-11-28 12:42:26,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-28 12:42:26,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 133 transitions. [2019-11-28 12:42:26,983 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 133 transitions. Word has length 53 [2019-11-28 12:42:26,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:42:26,984 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 133 transitions. [2019-11-28 12:42:26,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-28 12:42:26,984 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 133 transitions. [2019-11-28 12:42:26,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-28 12:42:26,985 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:42:26,985 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] [2019-11-28 12:42:27,193 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-28 12:42:27,193 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:42:27,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:42:27,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1487182461, now seen corresponding path program 1 times [2019-11-28 12:42:27,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:42:27,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [903601529] [2019-11-28 12:42:27,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-11-28 12:42:27,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:42:27,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 12:42:27,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:42:27,404 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 12:42:27,404 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:42:27,528 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 12:42:27,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [903601529] [2019-11-28 12:42:27,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:42:27,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2019-11-28 12:42:27,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220250264] [2019-11-28 12:42:27,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 12:42:27,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:42:27,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 12:42:27,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 12:42:27,529 INFO L87 Difference]: Start difference. First operand 127 states and 133 transitions. Second operand 8 states. [2019-11-28 12:42:27,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:42:27,577 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2019-11-28 12:42:27,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 12:42:27,578 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-11-28 12:42:27,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:42:27,579 INFO L225 Difference]: With dead ends: 129 [2019-11-28 12:42:27,579 INFO L226 Difference]: Without dead ends: 127 [2019-11-28 12:42:27,579 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-28 12:42:27,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-28 12:42:27,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-11-28 12:42:27,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-28 12:42:27,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2019-11-28 12:42:27,584 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 58 [2019-11-28 12:42:27,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:42:27,584 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2019-11-28 12:42:27,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 12:42:27,585 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2019-11-28 12:42:27,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-28 12:42:27,585 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:42:27,586 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] [2019-11-28 12:42:27,794 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-28 12:42:27,794 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:42:27,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:42:27,795 INFO L82 PathProgramCache]: Analyzing trace with hash -537222574, now seen corresponding path program 1 times [2019-11-28 12:42:27,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:42:27,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1521152658] [2019-11-28 12:42:27,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-11-28 12:42:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:42:27,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 12:42:27,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:42:28,039 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 12:42:28,039 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:42:28,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 12:42:28,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 12:42:28,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1521152658] [2019-11-28 12:42:28,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:42:28,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 11 [2019-11-28 12:42:28,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775850253] [2019-11-28 12:42:28,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 12:42:28,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:42:28,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 12:42:28,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-28 12:42:28,286 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand 11 states. [2019-11-28 12:42:28,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:42:28,388 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2019-11-28 12:42:28,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 12:42:28,389 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2019-11-28 12:42:28,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:42:28,390 INFO L225 Difference]: With dead ends: 131 [2019-11-28 12:42:28,390 INFO L226 Difference]: Without dead ends: 127 [2019-11-28 12:42:28,390 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 116 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 12:42:28,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-28 12:42:28,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-11-28 12:42:28,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-28 12:42:28,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2019-11-28 12:42:28,396 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 63 [2019-11-28 12:42:28,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:42:28,396 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2019-11-28 12:42:28,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 12:42:28,396 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2019-11-28 12:42:28,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-28 12:42:28,397 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:42:28,398 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] [2019-11-28 12:42:28,609 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-11-28 12:42:28,609 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:42:28,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:42:28,610 INFO L82 PathProgramCache]: Analyzing trace with hash -964060479, now seen corresponding path program 1 times [2019-11-28 12:42:28,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:42:28,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [515337329] [2019-11-28 12:42:28,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-11-28 12:42:28,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:42:28,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-28 12:42:28,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:42:28,858 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 12:42:28,858 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:42:28,860 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:42:28,860 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:42:28,860 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 12:42:29,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 12:42:29,190 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:42:29,378 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 12:42:29,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [515337329] [2019-11-28 12:42:29,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:42:29,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16, 15] imperfect sequences [] total 16 [2019-11-28 12:42:29,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848839823] [2019-11-28 12:42:29,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-28 12:42:29,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:42:29,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 12:42:29,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-11-28 12:42:29,382 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 17 states. [2019-11-28 12:42:30,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:42:30,697 INFO L93 Difference]: Finished difference Result 178 states and 198 transitions. [2019-11-28 12:42:30,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 12:42:30,697 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 74 [2019-11-28 12:42:30,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:42:30,699 INFO L225 Difference]: With dead ends: 178 [2019-11-28 12:42:30,699 INFO L226 Difference]: Without dead ends: 178 [2019-11-28 12:42:30,699 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 127 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-28 12:42:30,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-28 12:42:30,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 154. [2019-11-28 12:42:30,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-28 12:42:30,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2019-11-28 12:42:30,708 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 74 [2019-11-28 12:42:30,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:42:30,709 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2019-11-28 12:42:30,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-28 12:42:30,709 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2019-11-28 12:42:30,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-28 12:42:30,710 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:42:30,710 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] [2019-11-28 12:42:30,922 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-11-28 12:42:30,922 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:42:30,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:42:30,924 INFO L82 PathProgramCache]: Analyzing trace with hash -964060478, now seen corresponding path program 1 times [2019-11-28 12:42:30,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:42:30,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1555131524] [2019-11-28 12:42:30,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-11-28 12:42:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:42:31,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-28 12:42:31,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:42:31,178 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 12:42:31,178 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:42:31,183 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:42:31,183 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:42:31,183 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 12:42:31,662 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 12:42:31,663 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:42:33,620 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 12:42:33,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1555131524] [2019-11-28 12:42:33,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:42:33,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17, 16] imperfect sequences [] total 32 [2019-11-28 12:42:33,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701708367] [2019-11-28 12:42:33,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-28 12:42:33,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:42:33,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-28 12:42:33,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2019-11-28 12:42:33,623 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 33 states. [2019-11-28 12:42:37,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:42:37,117 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2019-11-28 12:42:37,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 12:42:37,118 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 74 [2019-11-28 12:42:37,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:42:37,119 INFO L225 Difference]: With dead ends: 152 [2019-11-28 12:42:37,120 INFO L226 Difference]: Without dead ends: 152 [2019-11-28 12:42:37,120 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 112 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=132, Invalid=1350, Unknown=0, NotChecked=0, Total=1482 [2019-11-28 12:42:37,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-28 12:42:37,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-11-28 12:42:37,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-28 12:42:37,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 162 transitions. [2019-11-28 12:42:37,127 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 162 transitions. Word has length 74 [2019-11-28 12:42:37,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:42:37,128 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 162 transitions. [2019-11-28 12:42:37,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-28 12:42:37,128 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions. [2019-11-28 12:42:37,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-28 12:42:37,129 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:42:37,130 INFO L410 BasicCegarLoop]: trace histogram [16, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 12:42:37,334 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-11-28 12:42:37,335 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:42:37,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:42:37,335 INFO L82 PathProgramCache]: Analyzing trace with hash -770520951, now seen corresponding path program 1 times [2019-11-28 12:42:37,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:42:37,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1127171571] [2019-11-28 12:42:37,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-11-28 12:42:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:42:37,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 12:42:37,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:42:37,629 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 12:42:37,630 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:42:37,889 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-11-28 12:42:37,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1127171571] [2019-11-28 12:42:37,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 12:42:37,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 11 [2019-11-28 12:42:37,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24099098] [2019-11-28 12:42:37,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 12:42:37,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:42:37,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 12:42:37,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-28 12:42:37,892 INFO L87 Difference]: Start difference. First operand 152 states and 162 transitions. Second operand 10 states. [2019-11-28 12:42:37,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:42:37,987 INFO L93 Difference]: Finished difference Result 153 states and 159 transitions. [2019-11-28 12:42:37,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 12:42:37,990 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2019-11-28 12:42:37,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:42:37,991 INFO L225 Difference]: With dead ends: 153 [2019-11-28 12:42:37,991 INFO L226 Difference]: Without dead ends: 149 [2019-11-28 12:42:37,992 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-28 12:42:37,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-28 12:42:37,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-11-28 12:42:37,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-28 12:42:37,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 155 transitions. [2019-11-28 12:42:37,997 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 155 transitions. Word has length 77 [2019-11-28 12:42:37,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:42:37,998 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 155 transitions. [2019-11-28 12:42:37,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 12:42:37,998 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 155 transitions. [2019-11-28 12:42:37,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-28 12:42:37,999 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:42:38,000 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] [2019-11-28 12:42:38,212 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-11-28 12:42:38,212 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:42:38,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:42:38,213 INFO L82 PathProgramCache]: Analyzing trace with hash 810528448, now seen corresponding path program 1 times [2019-11-28 12:42:38,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:42:38,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1341498749] [2019-11-28 12:42:38,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-11-28 12:42:38,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:42:38,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-28 12:42:38,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:42:38,486 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 12:42:38,486 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:42:38,487 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:42:38,488 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:42:38,488 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 12:42:38,816 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 12:42:38,816 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:42:39,045 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 12:42:39,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1341498749] [2019-11-28 12:42:39,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:42:39,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20, 19] imperfect sequences [] total 20 [2019-11-28 12:42:39,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701816844] [2019-11-28 12:42:39,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-28 12:42:39,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:42:39,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-28 12:42:39,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-11-28 12:42:39,048 INFO L87 Difference]: Start difference. First operand 149 states and 155 transitions. Second operand 21 states. [2019-11-28 12:42:40,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:42:40,709 INFO L93 Difference]: Finished difference Result 180 states and 196 transitions. [2019-11-28 12:42:40,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-28 12:42:40,710 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 87 [2019-11-28 12:42:40,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:42:40,712 INFO L225 Difference]: With dead ends: 180 [2019-11-28 12:42:40,713 INFO L226 Difference]: Without dead ends: 180 [2019-11-28 12:42:40,714 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 145 SyntacticMatches, 9 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2019-11-28 12:42:40,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-28 12:42:40,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 155. [2019-11-28 12:42:40,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-28 12:42:40,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 165 transitions. [2019-11-28 12:42:40,721 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 165 transitions. Word has length 87 [2019-11-28 12:42:40,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:42:40,722 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 165 transitions. [2019-11-28 12:42:40,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-28 12:42:40,722 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 165 transitions. [2019-11-28 12:42:40,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-28 12:42:40,723 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:42:40,723 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] [2019-11-28 12:42:40,936 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-11-28 12:42:40,937 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:42:40,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:42:40,937 INFO L82 PathProgramCache]: Analyzing trace with hash 810528449, now seen corresponding path program 1 times [2019-11-28 12:42:40,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:42:40,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [774773913] [2019-11-28 12:42:40,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-11-28 12:42:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:42:41,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-28 12:42:41,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:42:41,207 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 12:42:41,215 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:42:41,222 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:42:41,222 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:42:41,223 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 12:42:41,876 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 12:42:41,876 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:42:44,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 12:42:44,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [774773913] [2019-11-28 12:42:44,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:42:44,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21, 20] imperfect sequences [] total 40 [2019-11-28 12:42:44,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115960007] [2019-11-28 12:42:44,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-28 12:42:44,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:42:44,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-28 12:42:44,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1525, Unknown=0, NotChecked=0, Total=1640 [2019-11-28 12:42:44,192 INFO L87 Difference]: Start difference. First operand 155 states and 165 transitions. Second operand 41 states. [2019-11-28 12:42:48,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:42:48,933 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2019-11-28 12:42:48,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-28 12:42:48,934 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 87 [2019-11-28 12:42:48,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:42:48,935 INFO L225 Difference]: With dead ends: 153 [2019-11-28 12:42:48,935 INFO L226 Difference]: Without dead ends: 153 [2019-11-28 12:42:48,936 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 128 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=170, Invalid=2182, Unknown=0, NotChecked=0, Total=2352 [2019-11-28 12:42:48,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-28 12:42:48,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-11-28 12:42:48,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-28 12:42:48,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 162 transitions. [2019-11-28 12:42:48,941 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 162 transitions. Word has length 87 [2019-11-28 12:42:48,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:42:48,942 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 162 transitions. [2019-11-28 12:42:48,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-28 12:42:48,942 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 162 transitions. [2019-11-28 12:42:48,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-28 12:42:48,943 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:42:48,943 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] [2019-11-28 12:42:49,155 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-11-28 12:42:49,155 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:42:49,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:42:49,156 INFO L82 PathProgramCache]: Analyzing trace with hash 147123437, now seen corresponding path program 1 times [2019-11-28 12:42:49,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:42:49,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [914272254] [2019-11-28 12:42:49,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2019-11-28 12:42:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:42:49,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 12:42:49,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:42:50,113 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 12:42:50,113 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:42:51,014 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 12:42:51,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [914272254] [2019-11-28 12:42:51,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 12:42:51,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21, 19] imperfect sequences [] total 39 [2019-11-28 12:42:51,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696145116] [2019-11-28 12:42:51,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-28 12:42:51,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 12:42:51,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-28 12:42:51,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1410, Unknown=0, NotChecked=0, Total=1560 [2019-11-28 12:42:51,016 INFO L87 Difference]: Start difference. First operand 153 states and 162 transitions. Second operand 40 states. [2019-11-28 12:42:53,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 12:42:53,099 INFO L93 Difference]: Finished difference Result 152 states and 161 transitions. [2019-11-28 12:42:53,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-28 12:42:53,103 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 90 [2019-11-28 12:42:53,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 12:42:53,104 INFO L225 Difference]: With dead ends: 152 [2019-11-28 12:42:53,104 INFO L226 Difference]: Without dead ends: 152 [2019-11-28 12:42:53,105 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 136 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=206, Invalid=1956, Unknown=0, NotChecked=0, Total=2162 [2019-11-28 12:42:53,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-28 12:42:53,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-11-28 12:42:53,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-28 12:42:53,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 161 transitions. [2019-11-28 12:42:53,110 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 161 transitions. Word has length 90 [2019-11-28 12:42:53,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 12:42:53,110 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 161 transitions. [2019-11-28 12:42:53,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-28 12:42:53,111 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 161 transitions. [2019-11-28 12:42:53,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-28 12:42:53,112 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 12:42:53,112 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] [2019-11-28 12:42:53,321 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-11-28 12:42:53,321 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 12:42:53,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 12:42:53,322 INFO L82 PathProgramCache]: Analyzing trace with hash 2088002500, now seen corresponding path program 1 times [2019-11-28 12:42:53,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 12:42:53,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038533905] [2019-11-28 12:42:53,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2019-11-28 12:42:53,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 12:42:53,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 116 conjunts are in the unsatisfiable core [2019-11-28 12:42:53,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 12:42:53,723 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-28 12:42:53,723 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:42:53,731 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:42:53,731 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:42:53,731 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-11-28 12:42:53,812 INFO L343 Elim1Store]: treesize reduction 34, result has 22.7 percent of original size [2019-11-28 12:42:53,812 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 29 treesize of output 28 [2019-11-28 12:42:53,813 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:42:53,831 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:42:53,832 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:42:53,832 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2019-11-28 12:42:53,934 INFO L343 Elim1Store]: treesize reduction 80, result has 20.8 percent of original size [2019-11-28 12:42:53,934 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 41 treesize of output 43 [2019-11-28 12:42:53,935 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:42:53,954 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:42:53,955 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:42:53,955 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2019-11-28 12:42:54,166 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 21 [2019-11-28 12:42:54,168 INFO L343 Elim1Store]: treesize reduction 141, result has 18.0 percent of original size [2019-11-28 12:42:54,168 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 53 treesize of output 58 [2019-11-28 12:42:54,169 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:42:54,211 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:42:54,211 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:42:54,212 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:58, output treesize:54 [2019-11-28 12:42:54,412 INFO L343 Elim1Store]: treesize reduction 172, result has 16.9 percent of original size [2019-11-28 12:42:54,412 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 58 treesize of output 66 [2019-11-28 12:42:54,413 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:42:54,442 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:42:54,443 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:42:54,443 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:59 [2019-11-28 12:42:54,647 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 28 [2019-11-28 12:42:54,648 INFO L343 Elim1Store]: treesize reduction 246, result has 15.2 percent of original size [2019-11-28 12:42:54,649 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 69 treesize of output 80 [2019-11-28 12:42:54,649 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:42:54,691 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:42:54,691 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:42:54,691 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:74, output treesize:70 [2019-11-28 12:42:54,958 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 33 [2019-11-28 12:42:54,959 INFO L343 Elim1Store]: treesize reduction 332, result has 13.8 percent of original size [2019-11-28 12:42:54,959 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 80 treesize of output 94 [2019-11-28 12:42:54,960 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:42:55,002 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:42:55,003 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:42:55,003 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:85, output treesize:81 [2019-11-28 12:42:55,358 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 38 [2019-11-28 12:42:55,358 INFO L343 Elim1Store]: treesize reduction 430, result has 12.6 percent of original size [2019-11-28 12:42:55,359 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 28 case distinctions, treesize of input 91 treesize of output 108 [2019-11-28 12:42:55,360 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:42:55,411 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:42:55,411 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:42:55,411 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:96, output treesize:92 [2019-11-28 12:42:55,869 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 43 [2019-11-28 12:42:55,869 INFO L343 Elim1Store]: treesize reduction 540, result has 11.6 percent of original size [2019-11-28 12:42:55,870 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 102 treesize of output 122 [2019-11-28 12:42:55,872 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:42:55,987 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-28 12:42:55,987 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:42:55,987 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:42:55,988 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:107, output treesize:103 [2019-11-28 12:42:56,588 WARN L192 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 48 [2019-11-28 12:42:56,593 INFO L343 Elim1Store]: treesize reduction 662, result has 10.8 percent of original size [2019-11-28 12:42:56,593 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 45 case distinctions, treesize of input 113 treesize of output 136 [2019-11-28 12:42:56,595 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:42:56,670 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:42:56,670 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:42:56,671 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:118, output treesize:114 [2019-11-28 12:42:57,294 WARN L192 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 288 DAG size of output: 53 [2019-11-28 12:42:57,295 INFO L343 Elim1Store]: treesize reduction 796, result has 10.1 percent of original size [2019-11-28 12:42:57,295 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 124 treesize of output 150 [2019-11-28 12:42:57,296 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:42:57,374 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:42:57,375 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:42:57,375 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:129, output treesize:125 [2019-11-28 12:42:58,286 WARN L192 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 338 DAG size of output: 58 [2019-11-28 12:42:58,286 INFO L343 Elim1Store]: treesize reduction 942, result has 9.4 percent of original size [2019-11-28 12:42:58,287 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 66 case distinctions, treesize of input 135 treesize of output 164 [2019-11-28 12:42:58,288 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:42:58,378 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:42:58,378 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:42:58,378 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:140, output treesize:136 [2019-11-28 12:42:59,325 WARN L192 SmtUtils]: Spent 716.00 ms on a formula simplification. DAG size of input: 392 DAG size of output: 63 [2019-11-28 12:42:59,326 INFO L343 Elim1Store]: treesize reduction 1100, result has 8.9 percent of original size [2019-11-28 12:42:59,327 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 78 case distinctions, treesize of input 146 treesize of output 178 [2019-11-28 12:42:59,328 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:42:59,427 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:42:59,428 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:42:59,428 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:151, output treesize:147 [2019-11-28 12:43:00,617 WARN L192 SmtUtils]: Spent 942.00 ms on a formula simplification. DAG size of input: 450 DAG size of output: 68 [2019-11-28 12:43:00,621 INFO L343 Elim1Store]: treesize reduction 1270, result has 8.4 percent of original size [2019-11-28 12:43:00,622 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 157 treesize of output 192 [2019-11-28 12:43:00,622 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:43:00,740 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-28 12:43:00,741 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:43:00,741 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:43:00,741 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:162, output treesize:158 [2019-11-28 12:43:01,016 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-28 12:43:02,120 WARN L192 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 512 DAG size of output: 73 [2019-11-28 12:43:02,120 INFO L343 Elim1Store]: treesize reduction 1452, result has 7.9 percent of original size [2019-11-28 12:43:02,121 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 168 treesize of output 206 [2019-11-28 12:43:02,122 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:43:02,252 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-28 12:43:02,252 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:43:02,253 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:43:02,253 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:173, output treesize:169 [2019-11-28 12:43:02,587 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-28 12:43:03,854 WARN L192 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 578 DAG size of output: 78 [2019-11-28 12:43:03,855 INFO L343 Elim1Store]: treesize reduction 1646, result has 7.5 percent of original size [2019-11-28 12:43:03,855 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 120 case distinctions, treesize of input 179 treesize of output 220 [2019-11-28 12:43:03,857 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:43:03,998 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-28 12:43:03,999 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:43:03,999 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:43:04,000 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:179, output treesize:175 [2019-11-28 12:43:04,377 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-28 12:43:07,589 INFO L508 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 12:43:07,632 INFO L588 ElimStorePlain]: treesize reduction 88, result has 32.3 percent of original size [2019-11-28 12:43:07,633 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 12:43:07,633 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:42 [2019-11-28 12:43:09,643 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (= (store |c_old(#memory_$Pointer$.offset)| |c_ldv_kobject_init_internal_#in~kobj.base| (let ((.cse0 (bvadd |c_ldv_kobject_init_internal_#in~kobj.offset| (_ bv4 32)))) (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_ldv_kobject_init_internal_#in~kobj.base|) (bvadd |c_ldv_kobject_init_internal_#in~kobj.offset| (_ bv12 32)) v_DerPreprocessor_1) (bvadd |c_ldv_kobject_init_internal_#in~kobj.offset| (_ bv13 32)) v_DerPreprocessor_2) (bvadd |c_ldv_kobject_init_internal_#in~kobj.offset| (_ bv14 32)) v_DerPreprocessor_3) (bvadd |c_ldv_kobject_init_internal_#in~kobj.offset| (_ bv15 32)) v_DerPreprocessor_4) .cse0 .cse0) (bvadd |c_ldv_kobject_init_internal_#in~kobj.offset| (_ bv8 32)) .cse0))) |c_#memory_$Pointer$.offset|)) is different from true [2019-11-28 12:43:11,653 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (= (store |c_old(#memory_$Pointer$.offset)| |c_ldv_kobject_init_#in~kobj.base| (let ((.cse0 (bvadd |c_ldv_kobject_init_#in~kobj.offset| (_ bv4 32)))) (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_ldv_kobject_init_#in~kobj.base|) (bvadd |c_ldv_kobject_init_#in~kobj.offset| (_ bv12 32)) v_DerPreprocessor_1) (bvadd |c_ldv_kobject_init_#in~kobj.offset| (_ bv13 32)) v_DerPreprocessor_2) (bvadd |c_ldv_kobject_init_#in~kobj.offset| (_ bv14 32)) v_DerPreprocessor_3) (bvadd |c_ldv_kobject_init_#in~kobj.offset| (_ bv15 32)) v_DerPreprocessor_4) .cse0 .cse0) (bvadd |c_ldv_kobject_init_#in~kobj.offset| (_ bv8 32)) .cse0))) |c_#memory_$Pointer$.offset|)) is different from true [2019-11-28 12:43:11,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,670 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,671 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,674 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,675 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,683 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,690 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,692 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,693 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,706 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,721 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,724 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,738 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,750 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,765 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,771 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,802 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,803 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,808 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,809 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,813 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:11,831 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:43:11,831 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 16 select indices, 16 select index equivalence classes, 120 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 185 treesize of output 195 [2019-11-28 12:43:11,832 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:43:11,922 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:43:11,923 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:43:11,923 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:188, output treesize:114 [2019-11-28 12:43:15,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,802 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,803 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,808 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,809 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,813 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,823 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 12:43:15,832 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:43:15,832 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 135 treesize of output 123 [2019-11-28 12:43:15,833 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:43:15,871 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:43:15,871 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:43:15,871 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:140, output treesize:92 [2019-11-28 12:43:17,826 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:43:17,827 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 66 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 94 treesize of output 42 [2019-11-28 12:43:17,827 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:43:17,829 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:43:17,829 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 12:43:17,830 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:94, output treesize:3 [2019-11-28 12:43:18,312 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 12:43:18,312 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 12:43:20,273 INFO L508 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 12:43:20,288 INFO L588 ElimStorePlain]: treesize reduction 83, result has 24.5 percent of original size [2019-11-28 12:43:20,288 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 12:43:20,288 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:27 [2019-11-28 12:43:20,886 INFO L508 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 12:43:20,944 INFO L588 ElimStorePlain]: treesize reduction 82, result has 34.4 percent of original size [2019-11-28 12:43:20,945 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 12:43:20,945 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:69, output treesize:43 [2019-11-28 12:45:35,835 WARN L192 SmtUtils]: Spent 2.19 m on a formula simplification that was a NOOP. DAG size: 152 [2019-11-28 12:45:36,226 WARN L192 SmtUtils]: Spent 386.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-28 12:45:37,788 WARN L192 SmtUtils]: Spent 1.56 s on a formula simplification that was a NOOP. DAG size: 63 [2019-11-28 12:45:39,302 WARN L192 SmtUtils]: Spent 1.51 s on a formula simplification that was a NOOP. DAG size: 63 [2019-11-28 12:45:39,957 WARN L192 SmtUtils]: Spent 384.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-28 12:45:40,162 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-28 12:45:40,308 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-28 12:45:40,428 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-28 12:45:40,628 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-28 12:45:40,756 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-28 12:45:59,614 WARN L192 SmtUtils]: Spent 18.86 s on a formula simplification that was a NOOP. DAG size: 108 [2019-11-28 12:46:04,157 WARN L192 SmtUtils]: Spent 4.54 s on a formula simplification that was a NOOP. DAG size: 74 [2019-11-28 12:46:09,808 WARN L192 SmtUtils]: Spent 5.65 s on a formula simplification that was a NOOP. DAG size: 78 [2019-11-28 12:46:15,842 WARN L192 SmtUtils]: Spent 6.03 s on a formula simplification that was a NOOP. DAG size: 78 [2019-11-28 12:46:16,892 WARN L192 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-28 12:46:17,069 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-28 12:46:17,279 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-28 12:46:17,454 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-28 12:46:17,557 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-28 12:46:17,564 INFO L508 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 12:46:17,575 INFO L588 ElimStorePlain]: treesize reduction 91, result has 31.1 percent of original size [2019-11-28 12:46:17,576 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 12:46:17,576 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:41 [2019-11-28 12:46:18,654 WARN L192 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-28 12:46:18,819 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-28 12:46:18,917 INFO L508 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 12:46:18,991 INFO L588 ElimStorePlain]: treesize reduction 90, result has 37.9 percent of original size [2019-11-28 12:46:18,992 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 12:46:18,992 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:88, output treesize:55 [2019-11-28 12:46:19,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 12:46:19,822 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-11-28 12:46:19,822 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 12:46:19,870 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 12:46:20,071 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-11-28 12:46:20,073 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: alternation not yet supported: (forall ((|v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4| (_ BitVec 32))) (exists ((v_DerPreprocessor_18 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (v_DerPreprocessor_19 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32))) (or (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|)) (not (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base| (let ((.cse0 (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv4 32)))) (store (store (store (store (store (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv12 32)) v_DerPreprocessor_17) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv13 32)) v_DerPreprocessor_18) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv14 32)) v_DerPreprocessor_19) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv15 32)) v_DerPreprocessor_20) .cse0 .cse0) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv8 32)) .cse0))) |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|)))))) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:689) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:505) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-28 12:46:20,079 INFO L168 Benchmark]: Toolchain (without parser) took 256333.79 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 490.7 MB). Free memory was 960.4 MB in the beginning and 1.5 GB in the end (delta: -495.9 MB). Peak memory consumption was 640.6 MB. Max. memory is 11.5 GB. [2019-11-28 12:46:20,080 INFO L168 Benchmark]: CDTParser took 0.35 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 12:46:20,080 INFO L168 Benchmark]: CACSL2BoogieTranslator took 950.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -154.2 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2019-11-28 12:46:20,080 INFO L168 Benchmark]: Boogie Preprocessor took 120.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 12:46:20,081 INFO L168 Benchmark]: RCFGBuilder took 1562.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.8 MB in the end (delta: 109.4 MB). Peak memory consumption was 109.4 MB. Max. memory is 11.5 GB. [2019-11-28 12:46:20,081 INFO L168 Benchmark]: TraceAbstraction took 253688.40 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 337.1 MB). Free memory was 999.8 MB in the beginning and 1.5 GB in the end (delta: -456.5 MB). Peak memory consumption was 526.4 MB. Max. memory is 11.5 GB. [2019-11-28 12:46:20,083 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.35 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 950.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -154.2 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 120.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1562.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.8 MB in the end (delta: 109.4 MB). Peak memory consumption was 109.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 253688.40 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 337.1 MB). Free memory was 999.8 MB in the beginning and 1.5 GB in the end (delta: -456.5 MB). Peak memory consumption was 526.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported: (forall ((|v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4| (_ BitVec 32))) (exists ((v_DerPreprocessor_18 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (v_DerPreprocessor_19 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32))) (or (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|)) (not (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base| (let ((.cse0 (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv4 32)))) (store (store (store (store (store (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv12 32)) v_DerPreprocessor_17) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv13 32)) v_DerPreprocessor_18) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv14 32)) v_DerPreprocessor_19) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv15 32)) v_DerPreprocessor_20) .cse0 .cse0) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv8 32)) .cse0))) |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|)))))) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: (forall ((|v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4| (_ BitVec 32))) (exists ((v_DerPreprocessor_18 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (v_DerPreprocessor_19 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32))) (or (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|)) (not (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base| (let ((.cse0 (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv4 32)))) (store (store (store (store (store (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv12 32)) v_DerPreprocessor_17) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv13 32)) v_DerPreprocessor_18) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv14 32)) v_DerPreprocessor_19) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv15 32)) v_DerPreprocessor_20) .cse0 .cse0) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv8 32)) .cse0))) |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|)))))): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:689) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...