./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_bbfba256-3593-413b-91b0-4ab82622f613/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_bbfba256-3593-413b-91b0-4ab82622f613/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bbfba256-3593-413b-91b0-4ab82622f613/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bbfba256-3593-413b-91b0-4ab82622f613/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point.cil.out.i -s /tmp/vcloud-vcloud-master/worker/run_dir_bbfba256-3593-413b-91b0-4ab82622f613/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bbfba256-3593-413b-91b0-4ab82622f613/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8a86e259c83ba45b1c49d177e1b075e49ba00372 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:53:08,029 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:53:08,030 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:53:08,040 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:53:08,041 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:53:08,042 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:53:08,043 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:53:08,045 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:53:08,047 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:53:08,047 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:53:08,048 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:53:08,049 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:53:08,050 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:53:08,051 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:53:08,052 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:53:08,053 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:53:08,054 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:53:08,054 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:53:08,056 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:53:08,058 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:53:08,059 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:53:08,060 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:53:08,061 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:53:08,062 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:53:08,065 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:53:08,065 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:53:08,065 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:53:08,066 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:53:08,067 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:53:08,068 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:53:08,068 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:53:08,069 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:53:08,069 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:53:08,070 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:53:08,071 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:53:08,071 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:53:08,072 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:53:08,072 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:53:08,072 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:53:08,073 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:53:08,073 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:53:08,074 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bbfba256-3593-413b-91b0-4ab82622f613/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf [2019-11-25 08:53:08,086 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:53:08,086 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:53:08,087 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:53:08,087 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:53:08,088 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:53:08,088 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:53:08,088 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:53:08,088 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:53:08,088 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:53:08,089 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:53:08,089 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:53:08,089 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:53:08,089 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:53:08,090 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:53:08,090 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:53:08,090 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:53:08,090 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:53:08,090 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:53:08,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:53:08,091 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:53:08,091 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:53:08,091 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:53:08,092 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:53:08,092 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:53:08,092 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:53:08,092 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-25 08:53:08,092 INFO L138 SettingsManager]: * To the following directory=dump/ Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_bbfba256-3593-413b-91b0-4ab82622f613/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8a86e259c83ba45b1c49d177e1b075e49ba00372 [2019-11-25 08:53:08,227 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:53:08,236 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:53:08,239 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:53:08,240 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:53:08,241 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:53:08,241 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bbfba256-3593-413b-91b0-4ab82622f613/bin/uautomizer/../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point.cil.out.i [2019-11-25 08:53:08,295 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bbfba256-3593-413b-91b0-4ab82622f613/bin/uautomizer/data/f06c2e5d8/5af9ba23c4434e71b1eff192e69bb4b2/FLAG7b7790a85 [2019-11-25 08:53:08,955 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:53:08,956 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bbfba256-3593-413b-91b0-4ab82622f613/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point.cil.out.i [2019-11-25 08:53:08,989 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bbfba256-3593-413b-91b0-4ab82622f613/bin/uautomizer/data/f06c2e5d8/5af9ba23c4434e71b1eff192e69bb4b2/FLAG7b7790a85 [2019-11-25 08:53:09,089 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bbfba256-3593-413b-91b0-4ab82622f613/bin/uautomizer/data/f06c2e5d8/5af9ba23c4434e71b1eff192e69bb4b2 [2019-11-25 08:53:09,092 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:53:09,093 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:53:09,094 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:53:09,095 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:53:09,098 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:53:09,099 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:53:09" (1/1) ... [2019-11-25 08:53:09,101 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@234af98e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:09, skipping insertion in model container [2019-11-25 08:53:09,101 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:53:09" (1/1) ... [2019-11-25 08:53:09,108 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:53:09,206 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:53:10,346 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:53:10,402 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:53:10,593 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:53:10,670 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:53:10,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:10 WrapperNode [2019-11-25 08:53:10,670 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:53:10,671 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:53:10,671 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:53:10,671 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:53:10,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:10" (1/1) ... [2019-11-25 08:53:10,732 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:10" (1/1) ... [2019-11-25 08:53:10,822 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:53:10,822 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:53:10,822 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:53:10,822 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:53:10,833 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:10" (1/1) ... [2019-11-25 08:53:10,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:10" (1/1) ... [2019-11-25 08:53:10,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:10" (1/1) ... [2019-11-25 08:53:10,858 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:10" (1/1) ... [2019-11-25 08:53:10,915 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:10" (1/1) ... [2019-11-25 08:53:10,940 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:10" (1/1) ... [2019-11-25 08:53:10,952 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:10" (1/1) ... [2019-11-25 08:53:10,967 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:53:10,973 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:53:10,973 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:53:10,973 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:53:10,974 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bbfba256-3593-413b-91b0-4ab82622f613/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:53:11,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 08:53:11,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 08:53:11,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:53:11,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 08:53:11,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:53:11,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-25 08:53:11,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-25 08:53:11,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:53:11,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:53:12,831 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:53:12,832 INFO L284 CfgBuilder]: Removed 127 assume(true) statements. [2019-11-25 08:53:12,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:53:12 BoogieIcfgContainer [2019-11-25 08:53:12,833 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:53:12,834 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:53:12,834 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:53:12,837 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:53:12,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:53:09" (1/3) ... [2019-11-25 08:53:12,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ecfc4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:53:12, skipping insertion in model container [2019-11-25 08:53:12,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:53:10" (2/3) ... [2019-11-25 08:53:12,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ecfc4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:53:12, skipping insertion in model container [2019-11-25 08:53:12,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:53:12" (3/3) ... [2019-11-25 08:53:12,840 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point.cil.out.i [2019-11-25 08:53:12,849 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:53:12,856 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-25 08:53:12,867 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-25 08:53:12,890 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:53:12,890 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:53:12,890 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:53:12,890 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:53:12,890 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:53:12,890 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:53:12,891 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:53:12,891 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:53:12,916 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-11-25 08:53:12,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-25 08:53:12,929 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:12,930 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] [2019-11-25 08:53:12,931 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:12,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:12,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1079717372, now seen corresponding path program 1 times [2019-11-25 08:53:12,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:12,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794282511] [2019-11-25 08:53:12,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:13,572 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-25 08:53:13,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794282511] [2019-11-25 08:53:13,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:13,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:53:13,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130796269] [2019-11-25 08:53:13,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:13,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:13,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:13,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:13,597 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 3 states. [2019-11-25 08:53:13,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:13,713 INFO L93 Difference]: Finished difference Result 366 states and 539 transitions. [2019-11-25 08:53:13,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:13,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-25 08:53:13,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:13,727 INFO L225 Difference]: With dead ends: 366 [2019-11-25 08:53:13,727 INFO L226 Difference]: Without dead ends: 217 [2019-11-25 08:53:13,731 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-25 08:53:13,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-11-25 08:53:13,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 203. [2019-11-25 08:53:13,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-11-25 08:53:13,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 290 transitions. [2019-11-25 08:53:13,781 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 290 transitions. Word has length 27 [2019-11-25 08:53:13,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:13,782 INFO L462 AbstractCegarLoop]: Abstraction has 203 states and 290 transitions. [2019-11-25 08:53:13,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:13,782 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 290 transitions. [2019-11-25 08:53:13,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-25 08:53:13,789 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:13,789 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] [2019-11-25 08:53:13,789 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:13,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:13,790 INFO L82 PathProgramCache]: Analyzing trace with hash -926810451, now seen corresponding path program 1 times [2019-11-25 08:53:13,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:13,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494002842] [2019-11-25 08:53:13,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:13,983 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-25 08:53:13,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494002842] [2019-11-25 08:53:13,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:13,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:53:13,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179428654] [2019-11-25 08:53:13,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:13,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:13,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:13,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:13,986 INFO L87 Difference]: Start difference. First operand 203 states and 290 transitions. Second operand 3 states. [2019-11-25 08:53:14,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:14,123 INFO L93 Difference]: Finished difference Result 544 states and 801 transitions. [2019-11-25 08:53:14,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:14,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-25 08:53:14,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:14,127 INFO L225 Difference]: With dead ends: 544 [2019-11-25 08:53:14,127 INFO L226 Difference]: Without dead ends: 359 [2019-11-25 08:53:14,133 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-25 08:53:14,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-11-25 08:53:14,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 355. [2019-11-25 08:53:14,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-11-25 08:53:14,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 522 transitions. [2019-11-25 08:53:14,170 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 522 transitions. Word has length 30 [2019-11-25 08:53:14,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:14,172 INFO L462 AbstractCegarLoop]: Abstraction has 355 states and 522 transitions. [2019-11-25 08:53:14,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:14,172 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 522 transitions. [2019-11-25 08:53:14,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-25 08:53:14,177 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:14,178 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, 1, 1, 1, 1, 1] [2019-11-25 08:53:14,178 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:14,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:14,179 INFO L82 PathProgramCache]: Analyzing trace with hash -452402829, now seen corresponding path program 1 times [2019-11-25 08:53:14,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:14,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468903926] [2019-11-25 08:53:14,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:14,398 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-25 08:53:14,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468903926] [2019-11-25 08:53:14,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:14,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:53:14,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806185671] [2019-11-25 08:53:14,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:14,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:14,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:14,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:14,400 INFO L87 Difference]: Start difference. First operand 355 states and 522 transitions. Second operand 3 states. [2019-11-25 08:53:14,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:14,414 INFO L93 Difference]: Finished difference Result 355 states and 522 transitions. [2019-11-25 08:53:14,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:14,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-25 08:53:14,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:14,418 INFO L225 Difference]: With dead ends: 355 [2019-11-25 08:53:14,418 INFO L226 Difference]: Without dead ends: 353 [2019-11-25 08:53:14,419 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-25 08:53:14,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-11-25 08:53:14,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2019-11-25 08:53:14,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-11-25 08:53:14,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 520 transitions. [2019-11-25 08:53:14,465 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 520 transitions. Word has length 37 [2019-11-25 08:53:14,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:14,466 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 520 transitions. [2019-11-25 08:53:14,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:14,466 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 520 transitions. [2019-11-25 08:53:14,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-25 08:53:14,469 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:14,469 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, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:14,469 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:14,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:14,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1139579328, now seen corresponding path program 1 times [2019-11-25 08:53:14,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:14,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766877795] [2019-11-25 08:53:14,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:14,694 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-25 08:53:14,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766877795] [2019-11-25 08:53:14,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:14,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:53:14,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717848315] [2019-11-25 08:53:14,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:14,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:14,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:14,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:14,696 INFO L87 Difference]: Start difference. First operand 353 states and 520 transitions. Second operand 3 states. [2019-11-25 08:53:14,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:14,709 INFO L93 Difference]: Finished difference Result 353 states and 520 transitions. [2019-11-25 08:53:14,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:14,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-25 08:53:14,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:14,712 INFO L225 Difference]: With dead ends: 353 [2019-11-25 08:53:14,712 INFO L226 Difference]: Without dead ends: 351 [2019-11-25 08:53:14,714 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-25 08:53:14,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-11-25 08:53:14,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2019-11-25 08:53:14,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-11-25 08:53:14,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 518 transitions. [2019-11-25 08:53:14,736 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 518 transitions. Word has length 38 [2019-11-25 08:53:14,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:14,737 INFO L462 AbstractCegarLoop]: Abstraction has 351 states and 518 transitions. [2019-11-25 08:53:14,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:14,737 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 518 transitions. [2019-11-25 08:53:14,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-25 08:53:14,738 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:14,739 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:14,739 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:14,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:14,739 INFO L82 PathProgramCache]: Analyzing trace with hash -967214307, now seen corresponding path program 1 times [2019-11-25 08:53:14,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:14,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606211425] [2019-11-25 08:53:14,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:14,985 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-25 08:53:14,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606211425] [2019-11-25 08:53:14,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:14,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:53:14,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350193472] [2019-11-25 08:53:14,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:14,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:14,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:14,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:14,987 INFO L87 Difference]: Start difference. First operand 351 states and 518 transitions. Second operand 3 states. [2019-11-25 08:53:15,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:15,001 INFO L93 Difference]: Finished difference Result 351 states and 518 transitions. [2019-11-25 08:53:15,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:15,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-25 08:53:15,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:15,006 INFO L225 Difference]: With dead ends: 351 [2019-11-25 08:53:15,006 INFO L226 Difference]: Without dead ends: 349 [2019-11-25 08:53:15,006 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-25 08:53:15,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-11-25 08:53:15,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2019-11-25 08:53:15,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-11-25 08:53:15,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 516 transitions. [2019-11-25 08:53:15,020 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 516 transitions. Word has length 39 [2019-11-25 08:53:15,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:15,020 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 516 transitions. [2019-11-25 08:53:15,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:15,021 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 516 transitions. [2019-11-25 08:53:15,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-25 08:53:15,023 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:15,024 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:15,024 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:15,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:15,024 INFO L82 PathProgramCache]: Analyzing trace with hash 81134058, now seen corresponding path program 1 times [2019-11-25 08:53:15,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:15,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842549912] [2019-11-25 08:53:15,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:15,177 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-25 08:53:15,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842549912] [2019-11-25 08:53:15,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:15,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:53:15,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539697528] [2019-11-25 08:53:15,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:15,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:15,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:15,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:15,178 INFO L87 Difference]: Start difference. First operand 349 states and 516 transitions. Second operand 3 states. [2019-11-25 08:53:15,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:15,220 INFO L93 Difference]: Finished difference Result 1001 states and 1502 transitions. [2019-11-25 08:53:15,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:15,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-25 08:53:15,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:15,226 INFO L225 Difference]: With dead ends: 1001 [2019-11-25 08:53:15,226 INFO L226 Difference]: Without dead ends: 664 [2019-11-25 08:53:15,230 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-25 08:53:15,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2019-11-25 08:53:15,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 659. [2019-11-25 08:53:15,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-25 08:53:15,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 986 transitions. [2019-11-25 08:53:15,252 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 986 transitions. Word has length 40 [2019-11-25 08:53:15,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:15,254 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 986 transitions. [2019-11-25 08:53:15,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:15,255 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 986 transitions. [2019-11-25 08:53:15,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-25 08:53:15,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:15,260 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:15,260 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:15,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:15,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1376605001, now seen corresponding path program 1 times [2019-11-25 08:53:15,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:15,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005237709] [2019-11-25 08:53:15,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:15,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:15,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-25 08:53:15,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005237709] [2019-11-25 08:53:15,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:15,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:53:15,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409473749] [2019-11-25 08:53:15,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:53:15,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:15,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:53:15,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:53:15,425 INFO L87 Difference]: Start difference. First operand 659 states and 986 transitions. Second operand 3 states. [2019-11-25 08:53:15,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:15,518 INFO L93 Difference]: Finished difference Result 1300 states and 1953 transitions. [2019-11-25 08:53:15,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:53:15,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-25 08:53:15,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:15,523 INFO L225 Difference]: With dead ends: 1300 [2019-11-25 08:53:15,523 INFO L226 Difference]: Without dead ends: 659 [2019-11-25 08:53:15,524 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-25 08:53:15,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-11-25 08:53:15,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 658. [2019-11-25 08:53:15,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-11-25 08:53:15,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 981 transitions. [2019-11-25 08:53:15,547 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 981 transitions. Word has length 52 [2019-11-25 08:53:15,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:15,547 INFO L462 AbstractCegarLoop]: Abstraction has 658 states and 981 transitions. [2019-11-25 08:53:15,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:53:15,548 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 981 transitions. [2019-11-25 08:53:15,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-25 08:53:15,549 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:15,549 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:15,549 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:15,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:15,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1331921932, now seen corresponding path program 1 times [2019-11-25 08:53:15,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:15,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741791970] [2019-11-25 08:53:15,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:15,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:15,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-25 08:53:15,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741791970] [2019-11-25 08:53:15,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:15,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:53:15,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352364870] [2019-11-25 08:53:15,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:53:15,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:15,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:53:15,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:53:15,772 INFO L87 Difference]: Start difference. First operand 658 states and 981 transitions. Second operand 7 states. [2019-11-25 08:53:15,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:15,998 INFO L93 Difference]: Finished difference Result 2494 states and 3779 transitions. [2019-11-25 08:53:16,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:53:16,001 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-11-25 08:53:16,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:16,012 INFO L225 Difference]: With dead ends: 2494 [2019-11-25 08:53:16,013 INFO L226 Difference]: Without dead ends: 1854 [2019-11-25 08:53:16,015 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:53:16,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2019-11-25 08:53:16,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 659. [2019-11-25 08:53:16,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-25 08:53:16,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 981 transitions. [2019-11-25 08:53:16,069 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 981 transitions. Word has length 53 [2019-11-25 08:53:16,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:16,070 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 981 transitions. [2019-11-25 08:53:16,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:53:16,071 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 981 transitions. [2019-11-25 08:53:16,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-25 08:53:16,072 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:53:16,073 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:53:16,073 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:53:16,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:53:16,073 INFO L82 PathProgramCache]: Analyzing trace with hash 336433459, now seen corresponding path program 1 times [2019-11-25 08:53:16,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:53:16,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124121008] [2019-11-25 08:53:16,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:53:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:53:16,270 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-25 08:53:16,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124121008] [2019-11-25 08:53:16,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:53:16,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:53:16,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163306083] [2019-11-25 08:53:16,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:53:16,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:53:16,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:53:16,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:53:16,272 INFO L87 Difference]: Start difference. First operand 659 states and 981 transitions. Second operand 5 states. [2019-11-25 08:53:16,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:53:16,364 INFO L93 Difference]: Finished difference Result 946 states and 1424 transitions. [2019-11-25 08:53:16,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:53:16,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-11-25 08:53:16,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:53:16,365 INFO L225 Difference]: With dead ends: 946 [2019-11-25 08:53:16,365 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 08:53:16,367 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:53:16,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 08:53:16,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 08:53:16,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 08:53:16,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 08:53:16,368 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2019-11-25 08:53:16,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:53:16,368 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:53:16,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:53:16,368 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:53:16,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 08:53:16,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-25 08:53:17,361 INFO L444 ceAbstractionStarter]: For program point L6014(line 6014) no Hoare annotation was computed. [2019-11-25 08:53:17,361 INFO L444 ceAbstractionStarter]: For program point L6113(line 6113) no Hoare annotation was computed. [2019-11-25 08:53:17,361 INFO L444 ceAbstractionStarter]: For program point L6080(lines 6080 6084) no Hoare annotation was computed. [2019-11-25 08:53:17,361 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 6319) no Hoare annotation was computed. [2019-11-25 08:53:17,362 INFO L440 ceAbstractionStarter]: At program point L6312(lines 1 7019) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-25 08:53:17,362 INFO L444 ceAbstractionStarter]: For program point L6114(lines 6114 6150) no Hoare annotation was computed. [2019-11-25 08:53:17,362 INFO L447 ceAbstractionStarter]: At program point L6213(lines 5965 6215) the Hoare annotation is: true [2019-11-25 08:53:17,362 INFO L444 ceAbstractionStarter]: For program point L6015(lines 6015 6030) no Hoare annotation was computed. [2019-11-25 08:53:17,362 INFO L440 ceAbstractionStarter]: At program point L7006(lines 7005 7007) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-25 08:53:17,362 INFO L440 ceAbstractionStarter]: At program point L5751(lines 5743 5753) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_6~0 0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-25 08:53:17,362 INFO L440 ceAbstractionStarter]: At program point L5751-1(lines 5743 5753) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_6~0 0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-25 08:53:17,363 INFO L440 ceAbstractionStarter]: At program point L5751-4(lines 5743 5753) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_6~0 0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-25 08:53:17,363 INFO L440 ceAbstractionStarter]: At program point L5751-5(lines 5743 5753) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_6~0 0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-25 08:53:17,364 INFO L440 ceAbstractionStarter]: At program point L5751-2(lines 5743 5753) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_6~0 0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-25 08:53:17,364 INFO L440 ceAbstractionStarter]: At program point L5751-3(lines 5743 5753) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_6~0 0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-25 08:53:17,364 INFO L440 ceAbstractionStarter]: At program point L5751-6(lines 5743 5753) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-25 08:53:17,364 INFO L444 ceAbstractionStarter]: For program point L6181(line 6181) no Hoare annotation was computed. [2019-11-25 08:53:17,364 INFO L440 ceAbstractionStarter]: At program point L6974(lines 6973 6975) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_6~0 0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-25 08:53:17,365 INFO L444 ceAbstractionStarter]: For program point L6842(lines 6842 6845) no Hoare annotation was computed. [2019-11-25 08:53:17,365 INFO L440 ceAbstractionStarter]: At program point L6908(lines 1 7019) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-25 08:53:17,365 INFO L444 ceAbstractionStarter]: For program point L6842-1(lines 6842 6845) no Hoare annotation was computed. [2019-11-25 08:53:17,365 INFO L444 ceAbstractionStarter]: For program point L6050(line 6050) no Hoare annotation was computed. [2019-11-25 08:53:17,365 INFO L444 ceAbstractionStarter]: For program point L6116(lines 6116 6147) no Hoare annotation was computed. [2019-11-25 08:53:17,365 INFO L444 ceAbstractionStarter]: For program point L6017(lines 6017 6027) no Hoare annotation was computed. [2019-11-25 08:53:17,365 INFO L440 ceAbstractionStarter]: At program point L6282(lines 6277 6284) the Hoare annotation is: (let ((.cse0 (= 1 ~ldv_mutex_lock~0)) (.cse1 (= 1 ~ldv_mutex_i_mutex_of_inode~0)) (.cse2 (= 1 ~ldv_mutex_mutex_of_device~0))) (or (and .cse0 .cse1 (<= 0 |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res|) .cse2 (= 2 ~ldv_mutex_udev~0) (= 0 |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res|)) (and .cse0 (= 1 ~ldv_mutex_udev~0) .cse1 (<= (+ |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res| 1) 0) (<= (+ |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res| 1) 0) .cse2 (<= (+ |ULTIMATE.start_ldv_undef_int_negative_#res| 1) 0) (<= (+ ULTIMATE.start_ldv_undef_int_negative_~ret~0 1) 0)))) [2019-11-25 08:53:17,365 INFO L444 ceAbstractionStarter]: For program point L6051(lines 6051 6111) no Hoare annotation was computed. [2019-11-25 08:53:17,366 INFO L444 ceAbstractionStarter]: For program point L6018(line 6018) no Hoare annotation was computed. [2019-11-25 08:53:17,366 INFO L444 ceAbstractionStarter]: For program point L6117(line 6117) no Hoare annotation was computed. [2019-11-25 08:53:17,366 INFO L444 ceAbstractionStarter]: For program point L6118(lines 6118 6123) no Hoare annotation was computed. [2019-11-25 08:53:17,366 INFO L444 ceAbstractionStarter]: For program point L6019(lines 6019 6023) no Hoare annotation was computed. [2019-11-25 08:53:17,366 INFO L440 ceAbstractionStarter]: At program point L7010(lines 7009 7011) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-25 08:53:17,366 INFO L444 ceAbstractionStarter]: For program point L6086(line 6086) no Hoare annotation was computed. [2019-11-25 08:53:17,366 INFO L444 ceAbstractionStarter]: For program point L6152(line 6152) no Hoare annotation was computed. [2019-11-25 08:53:17,366 INFO L440 ceAbstractionStarter]: At program point L6978(lines 6977 6979) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-25 08:53:17,367 INFO L444 ceAbstractionStarter]: For program point L6053(lines 6053 6108) no Hoare annotation was computed. [2019-11-25 08:53:17,367 INFO L444 ceAbstractionStarter]: For program point L6318(line 6318) no Hoare annotation was computed. [2019-11-25 08:53:17,367 INFO L444 ceAbstractionStarter]: For program point L6318-4(line 6318) no Hoare annotation was computed. [2019-11-25 08:53:17,367 INFO L444 ceAbstractionStarter]: For program point L6318-3(line 6318) no Hoare annotation was computed. [2019-11-25 08:53:17,367 INFO L444 ceAbstractionStarter]: For program point L6318-2(line 6318) no Hoare annotation was computed. [2019-11-25 08:53:17,367 INFO L444 ceAbstractionStarter]: For program point L6318-1(line 6318) no Hoare annotation was computed. [2019-11-25 08:53:17,367 INFO L444 ceAbstractionStarter]: For program point L6087(lines 6087 6094) no Hoare annotation was computed. [2019-11-25 08:53:17,367 INFO L444 ceAbstractionStarter]: For program point L6054(line 6054) no Hoare annotation was computed. [2019-11-25 08:53:17,367 INFO L444 ceAbstractionStarter]: For program point L6153(lines 6153 6168) no Hoare annotation was computed. [2019-11-25 08:53:17,367 INFO L444 ceAbstractionStarter]: For program point L6318-5(line 6318) no Hoare annotation was computed. [2019-11-25 08:53:17,368 INFO L440 ceAbstractionStarter]: At program point L6847(lines 6839 6849) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= 2 ~ldv_mutex_udev~0)) [2019-11-25 08:53:17,368 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 6319) no Hoare annotation was computed. [2019-11-25 08:53:17,368 INFO L444 ceAbstractionStarter]: For program point L6055(lines 6055 6063) no Hoare annotation was computed. [2019-11-25 08:53:17,368 INFO L444 ceAbstractionStarter]: For program point L6155(lines 6155 6165) no Hoare annotation was computed. [2019-11-25 08:53:17,368 INFO L444 ceAbstractionStarter]: For program point L6188(line 6188) no Hoare annotation was computed. [2019-11-25 08:53:17,368 INFO L440 ceAbstractionStarter]: At program point L7014(lines 7013 7015) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-25 08:53:17,368 INFO L444 ceAbstractionStarter]: For program point L6089(lines 6089 6092) no Hoare annotation was computed. [2019-11-25 08:53:17,368 INFO L440 ceAbstractionStarter]: At program point L5759(lines 5754 5761) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_6~0 0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-25 08:53:17,368 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 6319) no Hoare annotation was computed. [2019-11-25 08:53:17,369 INFO L444 ceAbstractionStarter]: For program point L6189(lines 6189 6204) no Hoare annotation was computed. [2019-11-25 08:53:17,369 INFO L444 ceAbstractionStarter]: For program point L6156(line 6156) no Hoare annotation was computed. [2019-11-25 08:53:17,369 INFO L444 ceAbstractionStarter]: For program point L6057(lines 6057 6061) no Hoare annotation was computed. [2019-11-25 08:53:17,369 INFO L440 ceAbstractionStarter]: At program point L5826(lines 5823 5828) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-25 08:53:17,369 INFO L440 ceAbstractionStarter]: At program point L5826-3(lines 5823 5828) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-25 08:53:17,369 INFO L440 ceAbstractionStarter]: At program point L5826-1(lines 5823 5828) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-25 08:53:17,369 INFO L440 ceAbstractionStarter]: At program point L5826-2(lines 5823 5828) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-25 08:53:17,369 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 6319) no Hoare annotation was computed. [2019-11-25 08:53:17,370 INFO L444 ceAbstractionStarter]: For program point L6157(lines 6157 6161) no Hoare annotation was computed. [2019-11-25 08:53:17,370 INFO L444 ceAbstractionStarter]: For program point L6025(line 6025) no Hoare annotation was computed. [2019-11-25 08:53:17,370 INFO L444 ceAbstractionStarter]: For program point L6191(lines 6191 6201) no Hoare annotation was computed. [2019-11-25 08:53:17,370 INFO L444 ceAbstractionStarter]: For program point L6125(line 6125) no Hoare annotation was computed. [2019-11-25 08:53:17,370 INFO L444 ceAbstractionStarter]: For program point L6951(lines 6950 6968) no Hoare annotation was computed. [2019-11-25 08:53:17,370 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 6319) no Hoare annotation was computed. [2019-11-25 08:53:17,370 INFO L444 ceAbstractionStarter]: For program point L6126(lines 6126 6143) no Hoare annotation was computed. [2019-11-25 08:53:17,370 INFO L444 ceAbstractionStarter]: For program point L6192(line 6192) no Hoare annotation was computed. [2019-11-25 08:53:17,370 INFO L444 ceAbstractionStarter]: For program point L6193(lines 6193 6197) no Hoare annotation was computed. [2019-11-25 08:53:17,370 INFO L440 ceAbstractionStarter]: At program point L5962(lines 5956 5964) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-25 08:53:17,371 INFO L444 ceAbstractionStarter]: For program point L6128-2(lines 6126 6142) no Hoare annotation was computed. [2019-11-25 08:53:17,371 INFO L444 ceAbstractionStarter]: For program point L6128(lines 6128 6136) no Hoare annotation was computed. [2019-11-25 08:53:17,371 INFO L444 ceAbstractionStarter]: For program point L6096(line 6096) no Hoare annotation was computed. [2019-11-25 08:53:17,371 INFO L444 ceAbstractionStarter]: For program point L6955(lines 6950 6968) no Hoare annotation was computed. [2019-11-25 08:53:17,371 INFO L444 ceAbstractionStarter]: For program point L6163(line 6163) no Hoare annotation was computed. [2019-11-25 08:53:17,371 INFO L444 ceAbstractionStarter]: For program point L6097(lines 6097 6104) no Hoare annotation was computed. [2019-11-25 08:53:17,371 INFO L440 ceAbstractionStarter]: At program point L5767(lines 5762 5769) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-25 08:53:17,371 INFO L440 ceAbstractionStarter]: At program point L5767-1(lines 5762 5769) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-25 08:53:17,371 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-25 08:53:17,372 INFO L444 ceAbstractionStarter]: For program point L6329-1(lines 6329 6332) no Hoare annotation was computed. [2019-11-25 08:53:17,372 INFO L444 ceAbstractionStarter]: For program point L6329(lines 6329 6332) no Hoare annotation was computed. [2019-11-25 08:53:17,372 INFO L444 ceAbstractionStarter]: For program point L6065(line 6065) no Hoare annotation was computed. [2019-11-25 08:53:17,372 INFO L444 ceAbstractionStarter]: For program point L6032(line 6032) no Hoare annotation was computed. [2019-11-25 08:53:17,372 INFO L444 ceAbstractionStarter]: For program point L6099(lines 6099 6102) no Hoare annotation was computed. [2019-11-25 08:53:17,372 INFO L444 ceAbstractionStarter]: For program point L6066(lines 6066 6071) no Hoare annotation was computed. [2019-11-25 08:53:17,372 INFO L440 ceAbstractionStarter]: At program point L6991(lines 6990 6992) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-25 08:53:17,372 INFO L444 ceAbstractionStarter]: For program point L6033(lines 6033 6048) no Hoare annotation was computed. [2019-11-25 08:53:17,372 INFO L444 ceAbstractionStarter]: For program point L6066-2(lines 6053 6108) no Hoare annotation was computed. [2019-11-25 08:53:17,372 INFO L444 ceAbstractionStarter]: For program point L6199(line 6199) no Hoare annotation was computed. [2019-11-25 08:53:17,373 INFO L444 ceAbstractionStarter]: For program point L6959(lines 6950 6968) no Hoare annotation was computed. [2019-11-25 08:53:17,373 INFO L444 ceAbstractionStarter]: For program point L6035(lines 6035 6045) no Hoare annotation was computed. [2019-11-25 08:53:17,373 INFO L440 ceAbstractionStarter]: At program point L6333(lines 6322 6335) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (<= (+ |ULTIMATE.start_ldv_undef_int_negative_#res| 1) 0) (<= (+ ULTIMATE.start_ldv_undef_int_negative_~ret~0 1) 0)) [2019-11-25 08:53:17,373 INFO L444 ceAbstractionStarter]: For program point L6036(line 6036) no Hoare annotation was computed. [2019-11-25 08:53:17,373 INFO L444 ceAbstractionStarter]: For program point L5838(lines 5838 5841) no Hoare annotation was computed. [2019-11-25 08:53:17,373 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-25 08:53:17,373 INFO L440 ceAbstractionStarter]: At program point L6995(lines 6994 6996) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-25 08:53:17,373 INFO L444 ceAbstractionStarter]: For program point L6037(lines 6037 6041) no Hoare annotation was computed. [2019-11-25 08:53:17,373 INFO L444 ceAbstractionStarter]: For program point L6170(line 6170) no Hoare annotation was computed. [2019-11-25 08:53:17,374 INFO L440 ceAbstractionStarter]: At program point L5939(lines 5934 5941) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-25 08:53:17,374 INFO L447 ceAbstractionStarter]: At program point L6963(lines 6948 6969) the Hoare annotation is: true [2019-11-25 08:53:17,374 INFO L444 ceAbstractionStarter]: For program point L6171(lines 6171 6186) no Hoare annotation was computed. [2019-11-25 08:53:17,374 INFO L440 ceAbstractionStarter]: At program point L6304(lines 6293 6306) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-25 08:53:17,374 INFO L440 ceAbstractionStarter]: At program point L6139(lines 6951 6954) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-25 08:53:17,374 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-25 08:53:17,374 INFO L444 ceAbstractionStarter]: For program point L6106(line 6106) no Hoare annotation was computed. [2019-11-25 08:53:17,374 INFO L444 ceAbstractionStarter]: For program point L6932(lines 6932 6938) no Hoare annotation was computed. [2019-11-25 08:53:17,374 INFO L444 ceAbstractionStarter]: For program point L6206(line 6206) no Hoare annotation was computed. [2019-11-25 08:53:17,375 INFO L444 ceAbstractionStarter]: For program point L6173(lines 6173 6183) no Hoare annotation was computed. [2019-11-25 08:53:17,375 INFO L440 ceAbstractionStarter]: At program point L6999(lines 6998 7000) the Hoare annotation is: (and (<= 0 ULTIMATE.start_m5632_recover_~r~0) (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (<= 0 |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res|) (= 1 ~ldv_mutex_mutex_of_device~0) (= 2 ~ldv_mutex_udev~0) (= 0 |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res|)) [2019-11-25 08:53:17,375 INFO L444 ceAbstractionStarter]: For program point L6174(line 6174) no Hoare annotation was computed. [2019-11-25 08:53:17,375 INFO L444 ceAbstractionStarter]: For program point L6175(lines 6175 6179) no Hoare annotation was computed. [2019-11-25 08:53:17,375 INFO L444 ceAbstractionStarter]: For program point L6043(line 6043) no Hoare annotation was computed. [2019-11-25 08:53:17,375 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-25 08:53:17,375 INFO L440 ceAbstractionStarter]: At program point L6209(lines 5988 6214) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-25 08:53:17,375 INFO L444 ceAbstractionStarter]: For program point L-1-1(line -1) no Hoare annotation was computed. [2019-11-25 08:53:17,375 INFO L444 ceAbstractionStarter]: For program point L-1-2(line -1) no Hoare annotation was computed. [2019-11-25 08:53:17,376 INFO L440 ceAbstractionStarter]: At program point L7002(lines 7001 7003) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-25 08:53:17,376 INFO L444 ceAbstractionStarter]: For program point L-1-3(line -1) no Hoare annotation was computed. [2019-11-25 08:53:17,376 INFO L444 ceAbstractionStarter]: For program point L-1-4(line -1) no Hoare annotation was computed. [2019-11-25 08:53:17,376 INFO L444 ceAbstractionStarter]: For program point L-1-5(line -1) no Hoare annotation was computed. [2019-11-25 08:53:17,376 INFO L444 ceAbstractionStarter]: For program point L-1-6(line -1) no Hoare annotation was computed. [2019-11-25 08:53:17,376 INFO L444 ceAbstractionStarter]: For program point L6903-1(lines 6903 6906) no Hoare annotation was computed. [2019-11-25 08:53:17,376 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6319) no Hoare annotation was computed. [2019-11-25 08:53:17,378 INFO L444 ceAbstractionStarter]: For program point L6903(lines 6903 6906) no Hoare annotation was computed. [2019-11-25 08:53:17,379 INFO L440 ceAbstractionStarter]: At program point L-1-8(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_6~0 0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-25 08:53:17,379 INFO L444 ceAbstractionStarter]: For program point L-1-9(line -1) no Hoare annotation was computed. [2019-11-25 08:53:17,379 INFO L440 ceAbstractionStarter]: At program point L7002-1(lines 7001 7003) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-25 08:53:17,379 INFO L444 ceAbstractionStarter]: For program point L-1-10(line -1) no Hoare annotation was computed. [2019-11-25 08:53:17,379 INFO L440 ceAbstractionStarter]: At program point L6937(lines 6926 6940) the Hoare annotation is: (let ((.cse0 (= 1 ~ldv_mutex_lock~0)) (.cse1 (= 1 ~ldv_mutex_i_mutex_of_inode~0)) (.cse2 (= 1 ~ldv_mutex_mutex_of_device~0))) (or (and .cse0 .cse1 .cse2 (= 2 ~ldv_mutex_udev~0) (= 0 |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res|)) (and .cse0 (= 1 ~ldv_mutex_udev~0) .cse1 (<= (+ |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res| 1) 0) .cse2 (<= (+ |ULTIMATE.start_ldv_undef_int_negative_#res| 1) 0) (<= (+ ULTIMATE.start_ldv_undef_int_negative_~ret~0 1) 0)))) [2019-11-25 08:53:17,380 INFO L447 ceAbstractionStarter]: At program point L5781-2(lines 5780 5783) the Hoare annotation is: true [2019-11-25 08:53:17,380 INFO L447 ceAbstractionStarter]: At program point L5781-3(lines 5780 5783) the Hoare annotation is: true [2019-11-25 08:53:17,380 INFO L447 ceAbstractionStarter]: At program point L5781(lines 5780 5783) the Hoare annotation is: true [2019-11-25 08:53:17,380 INFO L447 ceAbstractionStarter]: At program point L5781-1(lines 5780 5783) the Hoare annotation is: true [2019-11-25 08:53:17,380 INFO L447 ceAbstractionStarter]: At program point L5781-6(lines 5780 5783) the Hoare annotation is: true [2019-11-25 08:53:17,380 INFO L447 ceAbstractionStarter]: At program point L5781-7(lines 5780 5783) the Hoare annotation is: true [2019-11-25 08:53:17,381 INFO L447 ceAbstractionStarter]: At program point L5781-4(lines 5780 5783) the Hoare annotation is: true [2019-11-25 08:53:17,381 INFO L447 ceAbstractionStarter]: At program point L5781-5(lines 5780 5783) the Hoare annotation is: true [2019-11-25 08:53:17,381 INFO L447 ceAbstractionStarter]: At program point L5781-8(lines 5780 5783) the Hoare annotation is: true [2019-11-25 08:53:17,381 INFO L444 ceAbstractionStarter]: For program point L6079(line 6079) no Hoare annotation was computed. [2019-11-25 08:53:17,381 INFO L444 ceAbstractionStarter]: For program point L6145(line 6145) no Hoare annotation was computed. [2019-11-25 08:53:17,381 INFO L440 ceAbstractionStarter]: At program point L6971(lines 6970 6972) the Hoare annotation is: (and (<= 0 ULTIMATE.start_m5632_recover_~r~0) (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (<= 0 |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res|) (= 1 ~ldv_mutex_mutex_of_device~0) (= 2 ~ldv_mutex_udev~0) (= 0 |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res|)) [2019-11-25 08:53:17,382 INFO L444 ceAbstractionStarter]: For program point L6013(lines 6013 6208) no Hoare annotation was computed. [2019-11-25 08:53:17,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:53:17 BoogieIcfgContainer [2019-11-25 08:53:17,429 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:53:17,430 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:53:17,430 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:53:17,430 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:53:17,431 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:53:12" (3/4) ... [2019-11-25 08:53:17,435 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 08:53:17,488 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 50 nodes and edges [2019-11-25 08:53:17,490 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-11-25 08:53:17,493 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 08:53:17,495 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-25 08:53:17,498 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-25 08:53:17,537 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && 2 == ldv_mutex_udev) && 0 == \result) || ((((((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && \result + 1 <= 0) && 1 == ldv_mutex_mutex_of_device) && \result + 1 <= 0) && ret + 1 <= 0) [2019-11-25 08:53:17,538 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && 0 <= \result) && 1 == ldv_mutex_mutex_of_device) && 2 == ldv_mutex_udev) && 0 == \result) || (((((((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && \result + 1 <= 0) && \result + 1 <= 0) && 1 == ldv_mutex_mutex_of_device) && \result + 1 <= 0) && ret + 1 <= 0) [2019-11-25 08:53:17,538 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && \result + 1 <= 0) && ret + 1 <= 0 [2019-11-25 08:53:17,538 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 <= r && 1 == ldv_mutex_lock) && 1 == ldv_mutex_i_mutex_of_inode) && 0 <= \result) && 1 == ldv_mutex_mutex_of_device) && 2 == ldv_mutex_udev) && 0 == \result [2019-11-25 08:53:17,539 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 <= r && 1 == ldv_mutex_lock) && 1 == ldv_mutex_i_mutex_of_inode) && 0 <= \result) && 1 == ldv_mutex_mutex_of_device) && 2 == ldv_mutex_udev) && 0 == \result [2019-11-25 08:53:17,801 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_bbfba256-3593-413b-91b0-4ab82622f613/bin/uautomizer/witness.graphml [2019-11-25 08:53:17,801 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:53:17,803 INFO L168 Benchmark]: Toolchain (without parser) took 8710.02 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 251.1 MB). Free memory was 939.2 MB in the beginning and 918.3 MB in the end (delta: 20.9 MB). Peak memory consumption was 272.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:53:17,804 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:53:17,805 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1576.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 195.0 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -149.6 MB). Peak memory consumption was 60.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:53:17,805 INFO L168 Benchmark]: Boogie Procedure Inliner took 150.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:53:17,805 INFO L168 Benchmark]: Boogie Preprocessor took 150.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:53:17,806 INFO L168 Benchmark]: RCFGBuilder took 1860.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -47.2 MB). Peak memory consumption was 167.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:53:17,806 INFO L168 Benchmark]: TraceAbstraction took 4595.01 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 56.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.8 MB). Peak memory consumption was 281.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:53:17,807 INFO L168 Benchmark]: Witness Printer took 371.80 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 918.3 MB in the end (delta: 174.5 MB). Peak memory consumption was 174.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:53:17,809 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1576.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 195.0 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -149.6 MB). Peak memory consumption was 60.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 150.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 150.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1860.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -47.2 MB). Peak memory consumption was 167.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4595.01 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 56.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.8 MB). Peak memory consumption was 281.3 MB. Max. memory is 11.5 GB. * Witness Printer took 371.80 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 918.3 MB in the end (delta: 174.5 MB). Peak memory consumption was 174.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6319]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6319]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6319]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6319]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6319]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6319]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 5988]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 6293]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_0 == 1) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 6839]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && 2 == ldv_mutex_udev - InvariantResult [Line: 6277]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && 0 <= \result) && 1 == ldv_mutex_mutex_of_device) && 2 == ldv_mutex_udev) && 0 == \result) || (((((((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && \result + 1 <= 0) && \result + 1 <= 0) && 1 == ldv_mutex_mutex_of_device) && \result + 1 <= 0) && ret + 1 <= 0) - InvariantResult [Line: 5956]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_0 == 1) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5754]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_6 == 0) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 6926]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && 2 == ldv_mutex_udev) && 0 == \result) || ((((((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && \result + 1 <= 0) && 1 == ldv_mutex_mutex_of_device) && \result + 1 <= 0) && ret + 1 <= 0) - InvariantResult [Line: 5780]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6998]: Loop Invariant Derived loop invariant: (((((0 <= r && 1 == ldv_mutex_lock) && 1 == ldv_mutex_i_mutex_of_inode) && 0 <= \result) && 1 == ldv_mutex_mutex_of_device) && 2 == ldv_mutex_udev) && 0 == \result - InvariantResult [Line: 7009]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5762]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5743]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_6 == 0) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 7013]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5743]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_6 == 0) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5934]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_0 == 1) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5965]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5743]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_6 == 0) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 6948]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6973]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_6 == 0) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5762]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5743]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_0 == 1) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5743]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_6 == 0) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5823]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5780]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5780]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7001]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5823]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5743]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_6 == 0) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5823]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5743]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_6 == 0) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5823]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 6977]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5780]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6970]: Loop Invariant Derived loop invariant: (((((0 <= r && 1 == ldv_mutex_lock) && 1 == ldv_mutex_i_mutex_of_inode) && 0 <= \result) && 1 == ldv_mutex_mutex_of_device) && 2 == ldv_mutex_udev) && 0 == \result - InvariantResult [Line: 6951]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5780]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6990]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5780]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7001]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5780]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_6 == 0) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 6994]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_0 == 1) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 7005]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5780]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6322]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && \result + 1 <= 0) && ret + 1 <= 0 - InvariantResult [Line: 5780]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 6 error locations. Result: SAFE, OverallTime: 4.4s, OverallIterations: 9, TraceHistogramMax: 3, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, HoareTripleCheckerStatistics: 2093 SDtfs, 2504 SDslu, 2768 SDs, 0 SdLazy, 88 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=659occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 1219 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 48 LocationsWithAnnotation, 48 PreInvPairs, 203 NumberOfFragments, 634 HoareAnnotationTreeSize, 48 FomulaSimplifications, 10313 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 48 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 374 NumberOfCodeBlocks, 374 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 365 ConstructedInterpolants, 0 QuantifiedInterpolants, 29377 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 16/16 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...