./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 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8190daf6-434e-4cc2-a266-82ff801947c5/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8190daf6-434e-4cc2-a266-82ff801947c5/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8190daf6-434e-4cc2-a266-82ff801947c5/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8190daf6-434e-4cc2-a266-82ff801947c5/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_8190daf6-434e-4cc2-a266-82ff801947c5/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8190daf6-434e-4cc2-a266-82ff801947c5/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 1fbd1ea1f262a27efe5a758a72a91735d41ce11e .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 09:26:34,752 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 09:26:34,754 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 09:26:34,769 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 09:26:34,770 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 09:26:34,771 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 09:26:34,773 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 09:26:34,781 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 09:26:34,785 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 09:26:34,789 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 09:26:34,790 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 09:26:34,791 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 09:26:34,792 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 09:26:34,794 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 09:26:34,795 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 09:26:34,796 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 09:26:34,797 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 09:26:34,798 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 09:26:34,800 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 09:26:34,804 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 09:26:34,808 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 09:26:34,809 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 09:26:34,812 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 09:26:34,813 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 09:26:34,816 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 09:26:34,817 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 09:26:34,817 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 09:26:34,818 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 09:26:34,819 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 09:26:34,820 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 09:26:34,820 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 09:26:34,821 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 09:26:34,821 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 09:26:34,822 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 09:26:34,823 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 09:26:34,823 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 09:26:34,824 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 09:26:34,824 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 09:26:34,824 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 09:26:34,825 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 09:26:34,826 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 09:26:34,827 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8190daf6-434e-4cc2-a266-82ff801947c5/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf [2019-11-20 09:26:34,851 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 09:26:34,861 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 09:26:34,862 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 09:26:34,862 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 09:26:34,862 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 09:26:34,863 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 09:26:34,863 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 09:26:34,863 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 09:26:34,863 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 09:26:34,863 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 09:26:34,864 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 09:26:34,864 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 09:26:34,864 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 09:26:34,864 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 09:26:34,864 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 09:26:34,866 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 09:26:34,866 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 09:26:34,866 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 09:26:34,866 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 09:26:34,867 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 09:26:34,867 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 09:26:34,867 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 09:26:34,867 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 09:26:34,867 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 09:26:34,868 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 09:26:34,868 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 09:26:34,868 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_8190daf6-434e-4cc2-a266-82ff801947c5/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 -> 1fbd1ea1f262a27efe5a758a72a91735d41ce11e [2019-11-20 09:26:35,016 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 09:26:35,026 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 09:26:35,029 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 09:26:35,031 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 09:26:35,031 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 09:26:35,032 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8190daf6-434e-4cc2-a266-82ff801947c5/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-20 09:26:35,079 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8190daf6-434e-4cc2-a266-82ff801947c5/bin/uautomizer/data/549e71b62/5a4a2d8199ed48e08d40af8905689a26/FLAG974cfc8df [2019-11-20 09:26:35,784 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 09:26:35,785 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8190daf6-434e-4cc2-a266-82ff801947c5/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-20 09:26:35,820 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8190daf6-434e-4cc2-a266-82ff801947c5/bin/uautomizer/data/549e71b62/5a4a2d8199ed48e08d40af8905689a26/FLAG974cfc8df [2019-11-20 09:26:36,100 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8190daf6-434e-4cc2-a266-82ff801947c5/bin/uautomizer/data/549e71b62/5a4a2d8199ed48e08d40af8905689a26 [2019-11-20 09:26:36,103 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 09:26:36,103 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 09:26:36,104 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 09:26:36,105 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 09:26:36,111 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 09:26:36,112 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:26:36" (1/1) ... [2019-11-20 09:26:36,114 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d5efd93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:26:36, skipping insertion in model container [2019-11-20 09:26:36,114 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:26:36" (1/1) ... [2019-11-20 09:26:36,119 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 09:26:36,226 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 09:26:37,270 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 09:26:37,328 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 09:26:37,540 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 09:26:37,644 INFO L192 MainTranslator]: Completed translation [2019-11-20 09:26:37,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:26:37 WrapperNode [2019-11-20 09:26:37,645 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 09:26:37,646 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 09:26:37,646 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 09:26:37,646 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 09:26:37,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:26:37" (1/1) ... [2019-11-20 09:26:37,709 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:26:37" (1/1) ... [2019-11-20 09:26:37,799 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 09:26:37,800 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 09:26:37,800 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 09:26:37,800 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 09:26:37,810 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:26:37" (1/1) ... [2019-11-20 09:26:37,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:26:37" (1/1) ... [2019-11-20 09:26:37,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:26:37" (1/1) ... [2019-11-20 09:26:37,829 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:26:37" (1/1) ... [2019-11-20 09:26:37,885 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:26:37" (1/1) ... [2019-11-20 09:26:37,894 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:26:37" (1/1) ... [2019-11-20 09:26:37,900 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:26:37" (1/1) ... [2019-11-20 09:26:37,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 09:26:37,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 09:26:37,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 09:26:37,911 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 09:26:37,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:26:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8190daf6-434e-4cc2-a266-82ff801947c5/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-20 09:26:37,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 09:26:37,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 09:26:37,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 09:26:37,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 09:26:37,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 09:26:37,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-20 09:26:37,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-20 09:26:37,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 09:26:37,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 09:26:39,693 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 09:26:39,693 INFO L285 CfgBuilder]: Removed 127 assume(true) statements. [2019-11-20 09:26:39,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:26:39 BoogieIcfgContainer [2019-11-20 09:26:39,695 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 09:26:39,696 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 09:26:39,696 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 09:26:39,699 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 09:26:39,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:26:36" (1/3) ... [2019-11-20 09:26:39,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4301cdb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:26:39, skipping insertion in model container [2019-11-20 09:26:39,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:26:37" (2/3) ... [2019-11-20 09:26:39,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4301cdb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:26:39, skipping insertion in model container [2019-11-20 09:26:39,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:26:39" (3/3) ... [2019-11-20 09:26:39,702 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-20 09:26:39,717 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 09:26:39,728 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-20 09:26:39,738 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-20 09:26:39,764 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 09:26:39,765 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 09:26:39,765 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 09:26:39,766 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 09:26:39,766 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 09:26:39,766 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 09:26:39,766 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 09:26:39,766 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 09:26:39,790 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-11-20 09:26:39,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 09:26:39,801 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:26:39,802 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-20 09:26:39,803 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-20 09:26:39,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:26:39,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1079717372, now seen corresponding path program 1 times [2019-11-20 09:26:39,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:26:39,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395843174] [2019-11-20 09:26:39,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:26:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:26:40,519 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-20 09:26:40,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395843174] [2019-11-20 09:26:40,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:26:40,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 09:26:40,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881924122] [2019-11-20 09:26:40,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 09:26:40,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:26:40,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 09:26:40,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:26:40,542 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 3 states. [2019-11-20 09:26:40,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:26:40,663 INFO L93 Difference]: Finished difference Result 366 states and 539 transitions. [2019-11-20 09:26:40,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:26:40,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-20 09:26:40,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:26:40,682 INFO L225 Difference]: With dead ends: 366 [2019-11-20 09:26:40,683 INFO L226 Difference]: Without dead ends: 217 [2019-11-20 09:26:40,685 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-20 09:26:40,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-11-20 09:26:40,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 203. [2019-11-20 09:26:40,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-11-20 09:26:40,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 290 transitions. [2019-11-20 09:26:40,735 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 290 transitions. Word has length 27 [2019-11-20 09:26:40,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:26:40,735 INFO L462 AbstractCegarLoop]: Abstraction has 203 states and 290 transitions. [2019-11-20 09:26:40,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 09:26:40,736 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 290 transitions. [2019-11-20 09:26:40,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-20 09:26:40,737 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:26:40,737 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-20 09:26:40,738 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-20 09:26:40,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:26:40,738 INFO L82 PathProgramCache]: Analyzing trace with hash -926810451, now seen corresponding path program 1 times [2019-11-20 09:26:40,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:26:40,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935344632] [2019-11-20 09:26:40,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:26:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:26:40,934 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-20 09:26:40,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935344632] [2019-11-20 09:26:40,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:26:40,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 09:26:40,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126823270] [2019-11-20 09:26:40,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 09:26:40,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:26:40,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 09:26:40,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:26:40,937 INFO L87 Difference]: Start difference. First operand 203 states and 290 transitions. Second operand 3 states. [2019-11-20 09:26:41,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:26:41,073 INFO L93 Difference]: Finished difference Result 544 states and 801 transitions. [2019-11-20 09:26:41,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:26:41,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-20 09:26:41,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:26:41,081 INFO L225 Difference]: With dead ends: 544 [2019-11-20 09:26:41,084 INFO L226 Difference]: Without dead ends: 359 [2019-11-20 09:26:41,086 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-20 09:26:41,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-11-20 09:26:41,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 355. [2019-11-20 09:26:41,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-11-20 09:26:41,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 522 transitions. [2019-11-20 09:26:41,140 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 522 transitions. Word has length 30 [2019-11-20 09:26:41,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:26:41,141 INFO L462 AbstractCegarLoop]: Abstraction has 355 states and 522 transitions. [2019-11-20 09:26:41,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 09:26:41,141 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 522 transitions. [2019-11-20 09:26:41,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 09:26:41,148 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:26:41,148 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-20 09:26:41,148 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-20 09:26:41,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:26:41,149 INFO L82 PathProgramCache]: Analyzing trace with hash -452402829, now seen corresponding path program 1 times [2019-11-20 09:26:41,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:26:41,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343134942] [2019-11-20 09:26:41,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:26:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:26:41,383 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-20 09:26:41,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343134942] [2019-11-20 09:26:41,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:26:41,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 09:26:41,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171082158] [2019-11-20 09:26:41,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 09:26:41,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:26:41,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 09:26:41,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:26:41,385 INFO L87 Difference]: Start difference. First operand 355 states and 522 transitions. Second operand 3 states. [2019-11-20 09:26:41,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:26:41,400 INFO L93 Difference]: Finished difference Result 355 states and 522 transitions. [2019-11-20 09:26:41,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:26:41,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-20 09:26:41,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:26:41,404 INFO L225 Difference]: With dead ends: 355 [2019-11-20 09:26:41,404 INFO L226 Difference]: Without dead ends: 353 [2019-11-20 09:26:41,405 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-20 09:26:41,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-11-20 09:26:41,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2019-11-20 09:26:41,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-11-20 09:26:41,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 520 transitions. [2019-11-20 09:26:41,445 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 520 transitions. Word has length 37 [2019-11-20 09:26:41,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:26:41,446 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 520 transitions. [2019-11-20 09:26:41,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 09:26:41,446 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 520 transitions. [2019-11-20 09:26:41,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 09:26:41,451 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:26:41,451 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-20 09:26:41,451 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-20 09:26:41,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:26:41,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1139579328, now seen corresponding path program 1 times [2019-11-20 09:26:41,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:26:41,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699646532] [2019-11-20 09:26:41,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:26:41,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:26:41,673 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-20 09:26:41,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699646532] [2019-11-20 09:26:41,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:26:41,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 09:26:41,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170909081] [2019-11-20 09:26:41,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 09:26:41,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:26:41,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 09:26:41,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:26:41,675 INFO L87 Difference]: Start difference. First operand 353 states and 520 transitions. Second operand 3 states. [2019-11-20 09:26:41,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:26:41,689 INFO L93 Difference]: Finished difference Result 353 states and 520 transitions. [2019-11-20 09:26:41,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:26:41,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-20 09:26:41,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:26:41,692 INFO L225 Difference]: With dead ends: 353 [2019-11-20 09:26:41,692 INFO L226 Difference]: Without dead ends: 351 [2019-11-20 09:26:41,694 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-20 09:26:41,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-11-20 09:26:41,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2019-11-20 09:26:41,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-11-20 09:26:41,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 518 transitions. [2019-11-20 09:26:41,715 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 518 transitions. Word has length 38 [2019-11-20 09:26:41,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:26:41,715 INFO L462 AbstractCegarLoop]: Abstraction has 351 states and 518 transitions. [2019-11-20 09:26:41,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 09:26:41,716 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 518 transitions. [2019-11-20 09:26:41,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-20 09:26:41,716 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:26:41,716 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-20 09:26:41,717 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-20 09:26:41,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:26:41,717 INFO L82 PathProgramCache]: Analyzing trace with hash -967214307, now seen corresponding path program 1 times [2019-11-20 09:26:41,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:26:41,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601954304] [2019-11-20 09:26:41,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:26:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:26:41,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:26:41,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601954304] [2019-11-20 09:26:41,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:26:41,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 09:26:41,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374280095] [2019-11-20 09:26:41,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 09:26:41,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:26:41,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 09:26:41,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:26:41,908 INFO L87 Difference]: Start difference. First operand 351 states and 518 transitions. Second operand 3 states. [2019-11-20 09:26:41,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:26:41,918 INFO L93 Difference]: Finished difference Result 351 states and 518 transitions. [2019-11-20 09:26:41,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:26:41,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-20 09:26:41,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:26:41,923 INFO L225 Difference]: With dead ends: 351 [2019-11-20 09:26:41,924 INFO L226 Difference]: Without dead ends: 349 [2019-11-20 09:26:41,926 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-20 09:26:41,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-11-20 09:26:41,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2019-11-20 09:26:41,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-11-20 09:26:41,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 516 transitions. [2019-11-20 09:26:41,940 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 516 transitions. Word has length 39 [2019-11-20 09:26:41,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:26:41,940 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 516 transitions. [2019-11-20 09:26:41,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 09:26:41,941 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 516 transitions. [2019-11-20 09:26:41,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 09:26:41,941 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:26:41,941 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-20 09:26:41,942 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-20 09:26:41,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:26:41,942 INFO L82 PathProgramCache]: Analyzing trace with hash 81134058, now seen corresponding path program 1 times [2019-11-20 09:26:41,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:26:41,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65185066] [2019-11-20 09:26:41,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:26:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:26:42,100 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-20 09:26:42,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65185066] [2019-11-20 09:26:42,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:26:42,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 09:26:42,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486248376] [2019-11-20 09:26:42,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 09:26:42,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:26:42,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 09:26:42,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:26:42,102 INFO L87 Difference]: Start difference. First operand 349 states and 516 transitions. Second operand 3 states. [2019-11-20 09:26:42,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:26:42,139 INFO L93 Difference]: Finished difference Result 1001 states and 1502 transitions. [2019-11-20 09:26:42,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:26:42,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-20 09:26:42,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:26:42,144 INFO L225 Difference]: With dead ends: 1001 [2019-11-20 09:26:42,144 INFO L226 Difference]: Without dead ends: 664 [2019-11-20 09:26:42,148 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-20 09:26:42,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2019-11-20 09:26:42,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 659. [2019-11-20 09:26:42,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-20 09:26:42,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 986 transitions. [2019-11-20 09:26:42,171 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 986 transitions. Word has length 40 [2019-11-20 09:26:42,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:26:42,173 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 986 transitions. [2019-11-20 09:26:42,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 09:26:42,174 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 986 transitions. [2019-11-20 09:26:42,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-20 09:26:42,179 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:26:42,179 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-20 09:26:42,179 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-20 09:26:42,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:26:42,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1376605001, now seen corresponding path program 1 times [2019-11-20 09:26:42,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:26:42,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243770020] [2019-11-20 09:26:42,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:26:42,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:26:42,331 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-20 09:26:42,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243770020] [2019-11-20 09:26:42,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:26:42,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 09:26:42,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139579672] [2019-11-20 09:26:42,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 09:26:42,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:26:42,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 09:26:42,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 09:26:42,335 INFO L87 Difference]: Start difference. First operand 659 states and 986 transitions. Second operand 3 states. [2019-11-20 09:26:42,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:26:42,429 INFO L93 Difference]: Finished difference Result 1300 states and 1953 transitions. [2019-11-20 09:26:42,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 09:26:42,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-20 09:26:42,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:26:42,433 INFO L225 Difference]: With dead ends: 1300 [2019-11-20 09:26:42,434 INFO L226 Difference]: Without dead ends: 659 [2019-11-20 09:26:42,435 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-20 09:26:42,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-11-20 09:26:42,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 658. [2019-11-20 09:26:42,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-11-20 09:26:42,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 981 transitions. [2019-11-20 09:26:42,461 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 981 transitions. Word has length 52 [2019-11-20 09:26:42,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:26:42,462 INFO L462 AbstractCegarLoop]: Abstraction has 658 states and 981 transitions. [2019-11-20 09:26:42,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 09:26:42,466 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 981 transitions. [2019-11-20 09:26:42,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-20 09:26:42,467 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:26:42,467 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-20 09:26:42,468 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-20 09:26:42,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:26:42,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1331921932, now seen corresponding path program 1 times [2019-11-20 09:26:42,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:26:42,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606401717] [2019-11-20 09:26:42,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:26:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:26:42,697 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-20 09:26:42,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606401717] [2019-11-20 09:26:42,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:26:42,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 09:26:42,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925778883] [2019-11-20 09:26:42,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 09:26:42,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:26:42,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 09:26:42,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-20 09:26:42,700 INFO L87 Difference]: Start difference. First operand 658 states and 981 transitions. Second operand 7 states. [2019-11-20 09:26:42,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:26:42,949 INFO L93 Difference]: Finished difference Result 2494 states and 3779 transitions. [2019-11-20 09:26:42,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 09:26:42,950 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-11-20 09:26:42,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:26:42,960 INFO L225 Difference]: With dead ends: 2494 [2019-11-20 09:26:42,961 INFO L226 Difference]: Without dead ends: 1854 [2019-11-20 09:26:42,963 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-20 09:26:42,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2019-11-20 09:26:43,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 659. [2019-11-20 09:26:43,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-20 09:26:43,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 981 transitions. [2019-11-20 09:26:43,025 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 981 transitions. Word has length 53 [2019-11-20 09:26:43,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:26:43,026 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 981 transitions. [2019-11-20 09:26:43,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 09:26:43,027 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 981 transitions. [2019-11-20 09:26:43,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-20 09:26:43,028 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:26:43,028 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-20 09:26:43,029 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-20 09:26:43,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:26:43,029 INFO L82 PathProgramCache]: Analyzing trace with hash 336433459, now seen corresponding path program 1 times [2019-11-20 09:26:43,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:26:43,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780906231] [2019-11-20 09:26:43,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:26:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:26:43,307 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-20 09:26:43,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780906231] [2019-11-20 09:26:43,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:26:43,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 09:26:43,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742181147] [2019-11-20 09:26:43,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 09:26:43,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:26:43,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 09:26:43,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 09:26:43,308 INFO L87 Difference]: Start difference. First operand 659 states and 981 transitions. Second operand 5 states. [2019-11-20 09:26:43,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:26:43,404 INFO L93 Difference]: Finished difference Result 946 states and 1424 transitions. [2019-11-20 09:26:43,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 09:26:43,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-11-20 09:26:43,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:26:43,406 INFO L225 Difference]: With dead ends: 946 [2019-11-20 09:26:43,406 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 09:26:43,407 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-20 09:26:43,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 09:26:43,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 09:26:43,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 09:26:43,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 09:26:43,408 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2019-11-20 09:26:43,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:26:43,408 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 09:26:43,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 09:26:43,409 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 09:26:43,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 09:26:43,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 09:26:44,300 INFO L444 ceAbstractionStarter]: For program point L6014(lines 6014 6209) no Hoare annotation was computed. [2019-11-20 09:26:44,300 INFO L444 ceAbstractionStarter]: For program point L6080(line 6080) no Hoare annotation was computed. [2019-11-20 09:26:44,301 INFO L440 ceAbstractionStarter]: At program point L6972(lines 6971 6973) 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-20 09:26:44,301 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 6320) no Hoare annotation was computed. [2019-11-20 09:26:44,301 INFO L444 ceAbstractionStarter]: For program point L6114(line 6114) no Hoare annotation was computed. [2019-11-20 09:26:44,301 INFO L444 ceAbstractionStarter]: For program point L6015(line 6015) no Hoare annotation was computed. [2019-11-20 09:26:44,301 INFO L444 ceAbstractionStarter]: For program point L6081(lines 6081 6085) no Hoare annotation was computed. [2019-11-20 09:26:44,301 INFO L447 ceAbstractionStarter]: At program point L6214(lines 5966 6216) the Hoare annotation is: true [2019-11-20 09:26:44,301 INFO L440 ceAbstractionStarter]: At program point L6313(lines 1 7024) 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-20 09:26:44,301 INFO L444 ceAbstractionStarter]: For program point L6115(lines 6115 6151) no Hoare annotation was computed. [2019-11-20 09:26:44,301 INFO L440 ceAbstractionStarter]: At program point L7007(lines 7006 7008) 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-20 09:26:44,301 INFO L444 ceAbstractionStarter]: For program point L6016(lines 6016 6031) no Hoare annotation was computed. [2019-11-20 09:26:44,302 INFO L440 ceAbstractionStarter]: At program point L5752-1(lines 5744 5754) 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-20 09:26:44,302 INFO L440 ceAbstractionStarter]: At program point L5752-2(lines 5744 5754) 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-20 09:26:44,302 INFO L440 ceAbstractionStarter]: At program point L5752(lines 5744 5754) 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-20 09:26:44,302 INFO L440 ceAbstractionStarter]: At program point L5752-5(lines 5744 5754) 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-20 09:26:44,306 INFO L440 ceAbstractionStarter]: At program point L5752-6(lines 5744 5754) 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-20 09:26:44,306 INFO L440 ceAbstractionStarter]: At program point L5752-3(lines 5744 5754) 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-20 09:26:44,306 INFO L440 ceAbstractionStarter]: At program point L5752-4(lines 5744 5754) 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-20 09:26:44,306 INFO L444 ceAbstractionStarter]: For program point L6182(line 6182) no Hoare annotation was computed. [2019-11-20 09:26:44,307 INFO L440 ceAbstractionStarter]: At program point L6975(lines 6974 6976) 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-20 09:26:44,307 INFO L444 ceAbstractionStarter]: For program point L6843-1(lines 6843 6846) no Hoare annotation was computed. [2019-11-20 09:26:44,307 INFO L444 ceAbstractionStarter]: For program point L6843(lines 6843 6846) no Hoare annotation was computed. [2019-11-20 09:26:44,307 INFO L440 ceAbstractionStarter]: At program point L6909(lines 1 7024) 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-20 09:26:44,307 INFO L444 ceAbstractionStarter]: For program point L6051(line 6051) no Hoare annotation was computed. [2019-11-20 09:26:44,307 INFO L444 ceAbstractionStarter]: For program point L6018(lines 6018 6028) no Hoare annotation was computed. [2019-11-20 09:26:44,307 INFO L444 ceAbstractionStarter]: For program point L6117(lines 6117 6148) no Hoare annotation was computed. [2019-11-20 09:26:44,307 INFO L440 ceAbstractionStarter]: At program point L6283(lines 6278 6285) 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-20 09:26:44,307 INFO L444 ceAbstractionStarter]: For program point L6118(line 6118) no Hoare annotation was computed. [2019-11-20 09:26:44,308 INFO L444 ceAbstractionStarter]: For program point L6019(line 6019) no Hoare annotation was computed. [2019-11-20 09:26:44,308 INFO L444 ceAbstractionStarter]: For program point L6052(lines 6052 6112) no Hoare annotation was computed. [2019-11-20 09:26:44,308 INFO L444 ceAbstractionStarter]: For program point L6119(lines 6119 6124) no Hoare annotation was computed. [2019-11-20 09:26:44,308 INFO L440 ceAbstractionStarter]: At program point L7011(lines 7010 7012) 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-20 09:26:44,308 INFO L444 ceAbstractionStarter]: For program point L6020(lines 6020 6024) no Hoare annotation was computed. [2019-11-20 09:26:44,308 INFO L444 ceAbstractionStarter]: For program point L6087(line 6087) no Hoare annotation was computed. [2019-11-20 09:26:44,308 INFO L444 ceAbstractionStarter]: For program point L6054(lines 6054 6109) no Hoare annotation was computed. [2019-11-20 09:26:44,308 INFO L444 ceAbstractionStarter]: For program point L6153(line 6153) no Hoare annotation was computed. [2019-11-20 09:26:44,308 INFO L440 ceAbstractionStarter]: At program point L6979(lines 6978 6980) 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-20 09:26:44,308 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 6320) no Hoare annotation was computed. [2019-11-20 09:26:44,309 INFO L444 ceAbstractionStarter]: For program point L6319-1(line 6319) no Hoare annotation was computed. [2019-11-20 09:26:44,309 INFO L444 ceAbstractionStarter]: For program point L6319(line 6319) no Hoare annotation was computed. [2019-11-20 09:26:44,309 INFO L444 ceAbstractionStarter]: For program point L6319-5(line 6319) no Hoare annotation was computed. [2019-11-20 09:26:44,309 INFO L444 ceAbstractionStarter]: For program point L6154(lines 6154 6169) no Hoare annotation was computed. [2019-11-20 09:26:44,309 INFO L444 ceAbstractionStarter]: For program point L6319-4(line 6319) no Hoare annotation was computed. [2019-11-20 09:26:44,309 INFO L444 ceAbstractionStarter]: For program point L6319-3(line 6319) no Hoare annotation was computed. [2019-11-20 09:26:44,309 INFO L444 ceAbstractionStarter]: For program point L6319-2(line 6319) no Hoare annotation was computed. [2019-11-20 09:26:44,309 INFO L444 ceAbstractionStarter]: For program point L6055(line 6055) no Hoare annotation was computed. [2019-11-20 09:26:44,309 INFO L444 ceAbstractionStarter]: For program point L6088(lines 6088 6095) no Hoare annotation was computed. [2019-11-20 09:26:44,309 INFO L440 ceAbstractionStarter]: At program point L6848(lines 6840 6850) 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-20 09:26:44,310 INFO L444 ceAbstractionStarter]: For program point L6056(lines 6056 6064) no Hoare annotation was computed. [2019-11-20 09:26:44,310 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 6320) no Hoare annotation was computed. [2019-11-20 09:26:44,310 INFO L444 ceAbstractionStarter]: For program point L6090(lines 6090 6093) no Hoare annotation was computed. [2019-11-20 09:26:44,310 INFO L444 ceAbstractionStarter]: For program point L6189(line 6189) no Hoare annotation was computed. [2019-11-20 09:26:44,310 INFO L444 ceAbstractionStarter]: For program point L6156(lines 6156 6166) no Hoare annotation was computed. [2019-11-20 09:26:44,310 INFO L440 ceAbstractionStarter]: At program point L7015(lines 7014 7016) 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-20 09:26:44,310 INFO L440 ceAbstractionStarter]: At program point L5760(lines 5755 5762) 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-20 09:26:44,310 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 6320) no Hoare annotation was computed. [2019-11-20 09:26:44,310 INFO L444 ceAbstractionStarter]: For program point L6190(lines 6190 6205) no Hoare annotation was computed. [2019-11-20 09:26:44,310 INFO L444 ceAbstractionStarter]: For program point L6058(lines 6058 6062) no Hoare annotation was computed. [2019-11-20 09:26:44,311 INFO L444 ceAbstractionStarter]: For program point L6157(line 6157) no Hoare annotation was computed. [2019-11-20 09:26:44,311 INFO L440 ceAbstractionStarter]: At program point L5827(lines 5824 5829) 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-20 09:26:44,311 INFO L440 ceAbstractionStarter]: At program point L5827-1(lines 5824 5829) 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-20 09:26:44,311 INFO L440 ceAbstractionStarter]: At program point L5827-2(lines 5824 5829) 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-20 09:26:44,311 INFO L440 ceAbstractionStarter]: At program point L5827-3(lines 5824 5829) 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-20 09:26:44,311 INFO L444 ceAbstractionStarter]: For program point L6158(lines 6158 6162) no Hoare annotation was computed. [2019-11-20 09:26:44,311 INFO L444 ceAbstractionStarter]: For program point L6026(line 6026) no Hoare annotation was computed. [2019-11-20 09:26:44,311 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 6320) no Hoare annotation was computed. [2019-11-20 09:26:44,311 INFO L444 ceAbstractionStarter]: For program point L6126(line 6126) no Hoare annotation was computed. [2019-11-20 09:26:44,312 INFO L444 ceAbstractionStarter]: For program point L6192(lines 6192 6202) no Hoare annotation was computed. [2019-11-20 09:26:44,312 INFO L444 ceAbstractionStarter]: For program point L6952(lines 6951 6969) no Hoare annotation was computed. [2019-11-20 09:26:44,312 INFO L444 ceAbstractionStarter]: For program point L6127(lines 6127 6144) no Hoare annotation was computed. [2019-11-20 09:26:44,312 INFO L444 ceAbstractionStarter]: For program point L6193(line 6193) no Hoare annotation was computed. [2019-11-20 09:26:44,312 INFO L444 ceAbstractionStarter]: For program point L6194(lines 6194 6198) no Hoare annotation was computed. [2019-11-20 09:26:44,312 INFO L440 ceAbstractionStarter]: At program point L5963(lines 5957 5965) 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-20 09:26:44,312 INFO L444 ceAbstractionStarter]: For program point L6129-2(lines 6127 6143) no Hoare annotation was computed. [2019-11-20 09:26:44,312 INFO L444 ceAbstractionStarter]: For program point L6129(lines 6129 6137) no Hoare annotation was computed. [2019-11-20 09:26:44,312 INFO L444 ceAbstractionStarter]: For program point L6097(line 6097) no Hoare annotation was computed. [2019-11-20 09:26:44,312 INFO L444 ceAbstractionStarter]: For program point L6956(lines 6951 6969) no Hoare annotation was computed. [2019-11-20 09:26:44,312 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 09:26:44,313 INFO L444 ceAbstractionStarter]: For program point L6098(lines 6098 6105) no Hoare annotation was computed. [2019-11-20 09:26:44,313 INFO L444 ceAbstractionStarter]: For program point L6164(line 6164) no Hoare annotation was computed. [2019-11-20 09:26:44,313 INFO L440 ceAbstractionStarter]: At program point L5768-1(lines 5763 5770) 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-20 09:26:44,313 INFO L440 ceAbstractionStarter]: At program point L5768(lines 5763 5770) 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-20 09:26:44,313 INFO L444 ceAbstractionStarter]: For program point L6330(lines 6330 6333) no Hoare annotation was computed. [2019-11-20 09:26:44,313 INFO L444 ceAbstractionStarter]: For program point L6330-1(lines 6330 6333) no Hoare annotation was computed. [2019-11-20 09:26:44,313 INFO L444 ceAbstractionStarter]: For program point L6066(line 6066) no Hoare annotation was computed. [2019-11-20 09:26:44,313 INFO L444 ceAbstractionStarter]: For program point L6033(line 6033) no Hoare annotation was computed. [2019-11-20 09:26:44,313 INFO L444 ceAbstractionStarter]: For program point L6067(lines 6067 6072) no Hoare annotation was computed. [2019-11-20 09:26:44,313 INFO L444 ceAbstractionStarter]: For program point L6034(lines 6034 6049) no Hoare annotation was computed. [2019-11-20 09:26:44,313 INFO L444 ceAbstractionStarter]: For program point L6100(lines 6100 6103) no Hoare annotation was computed. [2019-11-20 09:26:44,314 INFO L444 ceAbstractionStarter]: For program point L6067-2(lines 6054 6109) no Hoare annotation was computed. [2019-11-20 09:26:44,314 INFO L440 ceAbstractionStarter]: At program point L6992(lines 6991 6993) 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-20 09:26:44,314 INFO L444 ceAbstractionStarter]: For program point L6200(line 6200) no Hoare annotation was computed. [2019-11-20 09:26:44,314 INFO L444 ceAbstractionStarter]: For program point L6960(lines 6951 6969) no Hoare annotation was computed. [2019-11-20 09:26:44,314 INFO L444 ceAbstractionStarter]: For program point L6036(lines 6036 6046) no Hoare annotation was computed. [2019-11-20 09:26:44,314 INFO L440 ceAbstractionStarter]: At program point L6334(lines 6323 6336) 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-20 09:26:44,314 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 09:26:44,314 INFO L444 ceAbstractionStarter]: For program point L6037(line 6037) no Hoare annotation was computed. [2019-11-20 09:26:44,314 INFO L444 ceAbstractionStarter]: For program point L5839(lines 5839 5842) no Hoare annotation was computed. [2019-11-20 09:26:44,314 INFO L444 ceAbstractionStarter]: For program point L6038(lines 6038 6042) no Hoare annotation was computed. [2019-11-20 09:26:44,315 INFO L440 ceAbstractionStarter]: At program point L6996(lines 6995 6997) 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-20 09:26:44,315 INFO L444 ceAbstractionStarter]: For program point L6171(line 6171) no Hoare annotation was computed. [2019-11-20 09:26:44,315 INFO L447 ceAbstractionStarter]: At program point L6964(lines 6949 6970) the Hoare annotation is: true [2019-11-20 09:26:44,315 INFO L440 ceAbstractionStarter]: At program point L5940(lines 5935 5942) 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-20 09:26:44,315 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 09:26:44,315 INFO L444 ceAbstractionStarter]: For program point L6172(lines 6172 6187) no Hoare annotation was computed. [2019-11-20 09:26:44,315 INFO L440 ceAbstractionStarter]: At program point L6305(lines 6294 6307) 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-20 09:26:44,315 INFO L444 ceAbstractionStarter]: For program point L6107(line 6107) no Hoare annotation was computed. [2019-11-20 09:26:44,315 INFO L440 ceAbstractionStarter]: At program point L6140(lines 6952 6955) 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-20 09:26:44,316 INFO L444 ceAbstractionStarter]: For program point L6933(lines 6933 6939) no Hoare annotation was computed. [2019-11-20 09:26:44,316 INFO L444 ceAbstractionStarter]: For program point L6207(line 6207) no Hoare annotation was computed. [2019-11-20 09:26:44,316 INFO L444 ceAbstractionStarter]: For program point L6174(lines 6174 6184) no Hoare annotation was computed. [2019-11-20 09:26:44,316 INFO L440 ceAbstractionStarter]: At program point L7000(lines 6999 7001) 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-20 09:26:44,316 INFO L444 ceAbstractionStarter]: For program point L6175(line 6175) no Hoare annotation was computed. [2019-11-20 09:26:44,316 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 09:26:44,316 INFO L444 ceAbstractionStarter]: For program point L-1-1(line -1) no Hoare annotation was computed. [2019-11-20 09:26:44,316 INFO L444 ceAbstractionStarter]: For program point L6176(lines 6176 6180) no Hoare annotation was computed. [2019-11-20 09:26:44,316 INFO L444 ceAbstractionStarter]: For program point L-1-2(line -1) no Hoare annotation was computed. [2019-11-20 09:26:44,316 INFO L444 ceAbstractionStarter]: For program point L-1-3(line -1) no Hoare annotation was computed. [2019-11-20 09:26:44,316 INFO L444 ceAbstractionStarter]: For program point L-1-4(line -1) no Hoare annotation was computed. [2019-11-20 09:26:44,319 INFO L444 ceAbstractionStarter]: For program point L-1-5(line -1) no Hoare annotation was computed. [2019-11-20 09:26:44,319 INFO L444 ceAbstractionStarter]: For program point L6044(line 6044) no Hoare annotation was computed. [2019-11-20 09:26:44,319 INFO L444 ceAbstractionStarter]: For program point L-1-6(line -1) no Hoare annotation was computed. [2019-11-20 09:26:44,319 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6320) no Hoare annotation was computed. [2019-11-20 09:26:44,319 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-20 09:26:44,319 INFO L444 ceAbstractionStarter]: For program point L-1-9(line -1) no Hoare annotation was computed. [2019-11-20 09:26:44,320 INFO L444 ceAbstractionStarter]: For program point L-1-10(line -1) no Hoare annotation was computed. [2019-11-20 09:26:44,320 INFO L440 ceAbstractionStarter]: At program point L6210(lines 5989 6215) 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-20 09:26:44,320 INFO L440 ceAbstractionStarter]: At program point L7003-1(lines 7002 7004) 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-20 09:26:44,320 INFO L440 ceAbstractionStarter]: At program point L7003(lines 7002 7004) 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-20 09:26:44,320 INFO L444 ceAbstractionStarter]: For program point L6904-1(lines 6904 6907) no Hoare annotation was computed. [2019-11-20 09:26:44,320 INFO L444 ceAbstractionStarter]: For program point L6904(lines 6904 6907) no Hoare annotation was computed. [2019-11-20 09:26:44,321 INFO L440 ceAbstractionStarter]: At program point L6938(lines 6927 6941) 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-20 09:26:44,321 INFO L447 ceAbstractionStarter]: At program point L5782(lines 5781 5784) the Hoare annotation is: true [2019-11-20 09:26:44,321 INFO L447 ceAbstractionStarter]: At program point L5782-3(lines 5781 5784) the Hoare annotation is: true [2019-11-20 09:26:44,321 INFO L447 ceAbstractionStarter]: At program point L5782-4(lines 5781 5784) the Hoare annotation is: true [2019-11-20 09:26:44,321 INFO L447 ceAbstractionStarter]: At program point L5782-1(lines 5781 5784) the Hoare annotation is: true [2019-11-20 09:26:44,321 INFO L447 ceAbstractionStarter]: At program point L5782-2(lines 5781 5784) the Hoare annotation is: true [2019-11-20 09:26:44,322 INFO L447 ceAbstractionStarter]: At program point L5782-7(lines 5781 5784) the Hoare annotation is: true [2019-11-20 09:26:44,322 INFO L447 ceAbstractionStarter]: At program point L5782-8(lines 5781 5784) the Hoare annotation is: true [2019-11-20 09:26:44,322 INFO L447 ceAbstractionStarter]: At program point L5782-5(lines 5781 5784) the Hoare annotation is: true [2019-11-20 09:26:44,322 INFO L447 ceAbstractionStarter]: At program point L5782-6(lines 5781 5784) the Hoare annotation is: true [2019-11-20 09:26:44,322 INFO L444 ceAbstractionStarter]: For program point L6146(line 6146) no Hoare annotation was computed. [2019-11-20 09:26:44,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:26:44 BoogieIcfgContainer [2019-11-20 09:26:44,349 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 09:26:44,350 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 09:26:44,350 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 09:26:44,350 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 09:26:44,350 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:26:39" (3/4) ... [2019-11-20 09:26:44,353 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 09:26:44,388 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 53 nodes and edges [2019-11-20 09:26:44,390 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2019-11-20 09:26:44,393 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 09:26:44,434 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-20 09:26:44,434 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-20 09:26:44,435 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-20 09:26:44,435 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-20 09:26:44,435 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-20 09:26:44,712 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8190daf6-434e-4cc2-a266-82ff801947c5/bin/uautomizer/witness.graphml [2019-11-20 09:26:44,712 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 09:26:44,714 INFO L168 Benchmark]: Toolchain (without parser) took 8609.79 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 299.4 MB). Free memory was 939.2 MB in the beginning and 917.4 MB in the end (delta: 21.8 MB). Peak memory consumption was 321.2 MB. Max. memory is 11.5 GB. [2019-11-20 09:26:44,714 INFO L168 Benchmark]: CDTParser took 0.25 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-20 09:26:44,715 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1540.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 939.2 MB in the beginning and 1.0 GB in the end (delta: -77.0 MB). Peak memory consumption was 67.0 MB. Max. memory is 11.5 GB. [2019-11-20 09:26:44,715 INFO L168 Benchmark]: Boogie Procedure Inliner took 154.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-20 09:26:44,716 INFO L168 Benchmark]: Boogie Preprocessor took 110.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 995.1 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2019-11-20 09:26:44,716 INFO L168 Benchmark]: RCFGBuilder took 1784.31 ms. Allocated memory is still 1.2 GB. Free memory was 995.1 MB in the beginning and 811.0 MB in the end (delta: 184.1 MB). Peak memory consumption was 184.1 MB. Max. memory is 11.5 GB. [2019-11-20 09:26:44,717 INFO L168 Benchmark]: TraceAbstraction took 4653.50 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 170.4 MB). Free memory was 811.0 MB in the beginning and 1.1 GB in the end (delta: -277.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 09:26:44,717 INFO L168 Benchmark]: Witness Printer took 362.50 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 917.4 MB in the end (delta: 171.4 MB). Peak memory consumption was 171.4 MB. Max. memory is 11.5 GB. [2019-11-20 09:26:44,719 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.25 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 1540.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 939.2 MB in the beginning and 1.0 GB in the end (delta: -77.0 MB). Peak memory consumption was 67.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 154.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 110.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 995.1 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1784.31 ms. Allocated memory is still 1.2 GB. Free memory was 995.1 MB in the beginning and 811.0 MB in the end (delta: 184.1 MB). Peak memory consumption was 184.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4653.50 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 170.4 MB). Free memory was 811.0 MB in the beginning and 1.1 GB in the end (delta: -277.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 362.50 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 917.4 MB in the end (delta: 171.4 MB). Peak memory consumption was 171.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6320]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6320]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6320]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6320]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6320]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6320]: 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: 5744]: 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: 5824]: 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: 5744]: 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: 5824]: 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: 5781]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6974]: 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: 5744]: 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: 6978]: 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: 5824]: 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: 5744]: 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: 5824]: 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: 6952]: 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: 5781]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6971]: 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: 7002]: 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: 5781]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6991]: 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: 5781]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7002]: 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: 5781]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6995]: 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: 6323]: 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: 5781]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5781]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6294]: 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: 6278]: 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: 5957]: 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: 6840]: 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: 7006]: 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: 5781]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7010]: 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: 5755]: 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: 5781]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6999]: 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: 5989]: 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: 5763]: 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: 5744]: 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: 5966]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5763]: 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: 5744]: 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: 5744]: 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: 6927]: 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: 5935]: 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: -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: 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: 6949]: 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) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 7014]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 6 error locations. Result: SAFE, OverallTime: 4.5s, OverallIterations: 9, TraceHistogramMax: 3, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, 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, 10309 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 48 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.3s 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...