./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 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8a86e259c83ba45b1c49d177e1b075e49ba00372 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 01:54:14,558 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 01:54:14,560 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 01:54:14,572 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 01:54:14,572 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 01:54:14,573 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 01:54:14,575 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 01:54:14,577 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 01:54:14,579 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 01:54:14,580 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 01:54:14,581 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 01:54:14,582 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 01:54:14,582 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 01:54:14,583 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 01:54:14,584 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 01:54:14,586 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 01:54:14,586 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 01:54:14,588 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 01:54:14,590 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 01:54:14,592 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 01:54:14,593 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 01:54:14,594 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 01:54:14,596 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 01:54:14,597 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 01:54:14,599 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 01:54:14,599 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 01:54:14,600 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 01:54:14,601 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 01:54:14,601 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 01:54:14,602 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 01:54:14,602 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 01:54:14,603 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 01:54:14,604 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 01:54:14,605 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 01:54:14,606 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 01:54:14,606 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 01:54:14,607 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 01:54:14,607 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 01:54:14,608 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 01:54:14,609 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 01:54:14,610 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 01:54:14,611 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2019-11-28 01:54:14,629 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 01:54:14,629 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 01:54:14,630 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 01:54:14,630 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 01:54:14,632 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 01:54:14,632 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 01:54:14,632 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 01:54:14,633 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 01:54:14,633 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 01:54:14,633 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 01:54:14,634 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 01:54:14,635 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 01:54:14,635 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 01:54:14,636 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 01:54:14,636 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 01:54:14,636 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 01:54:14,636 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 01:54:14,636 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 01:54:14,636 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 01:54:14,637 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 01:54:14,637 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 01:54:14,637 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 01:54:14,637 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 01:54:14,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 01:54:14,638 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 01:54:14,638 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-28 01:54:14,639 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8a86e259c83ba45b1c49d177e1b075e49ba00372 [2019-11-28 01:54:14,923 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 01:54:14,939 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 01:54:14,942 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 01:54:14,943 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 01:54:14,943 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 01:54:14,943 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../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-28 01:54:15,005 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53ab7ebff/ca74e2d57c4842b09ce9908f83dd8247/FLAG3b60861c9 [2019-11-28 01:54:15,729 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 01:54:15,730 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/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-28 01:54:15,768 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53ab7ebff/ca74e2d57c4842b09ce9908f83dd8247/FLAG3b60861c9 [2019-11-28 01:54:15,928 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53ab7ebff/ca74e2d57c4842b09ce9908f83dd8247 [2019-11-28 01:54:15,932 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 01:54:15,933 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 01:54:15,934 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 01:54:15,934 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 01:54:15,937 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 01:54:15,938 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:54:15" (1/1) ... [2019-11-28 01:54:15,940 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21aba202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:54:15, skipping insertion in model container [2019-11-28 01:54:15,940 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:54:15" (1/1) ... [2019-11-28 01:54:15,947 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 01:54:16,063 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 01:54:17,469 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 01:54:17,531 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 01:54:17,756 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 01:54:17,878 INFO L208 MainTranslator]: Completed translation [2019-11-28 01:54:17,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:54:17 WrapperNode [2019-11-28 01:54:17,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 01:54:17,881 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 01:54:17,882 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 01:54:17,882 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 01:54:17,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:54:17" (1/1) ... [2019-11-28 01:54:17,981 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:54:17" (1/1) ... [2019-11-28 01:54:18,123 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 01:54:18,124 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 01:54:18,125 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 01:54:18,125 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 01:54:18,143 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:54:17" (1/1) ... [2019-11-28 01:54:18,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:54:17" (1/1) ... [2019-11-28 01:54:18,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:54:17" (1/1) ... [2019-11-28 01:54:18,170 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:54:17" (1/1) ... [2019-11-28 01:54:18,241 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:54:17" (1/1) ... [2019-11-28 01:54:18,268 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:54:17" (1/1) ... [2019-11-28 01:54:18,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:54:17" (1/1) ... [2019-11-28 01:54:18,307 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 01:54:18,310 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 01:54:18,310 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 01:54:18,310 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 01:54:18,311 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:54:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 01:54:18,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 01:54:18,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 01:54:18,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 01:54:18,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 01:54:18,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 01:54:18,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-28 01:54:18,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 01:54:18,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 01:54:18,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 01:54:19,835 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 01:54:19,835 INFO L297 CfgBuilder]: Removed 127 assume(true) statements. [2019-11-28 01:54:19,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:54:19 BoogieIcfgContainer [2019-11-28 01:54:19,837 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 01:54:19,839 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 01:54:19,839 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 01:54:19,842 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 01:54:19,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 01:54:15" (1/3) ... [2019-11-28 01:54:19,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77ac8915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:54:19, skipping insertion in model container [2019-11-28 01:54:19,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:54:17" (2/3) ... [2019-11-28 01:54:19,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77ac8915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:54:19, skipping insertion in model container [2019-11-28 01:54:19,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:54:19" (3/3) ... [2019-11-28 01:54:19,847 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-28 01:54:19,858 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 01:54:19,867 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-28 01:54:19,880 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-28 01:54:19,907 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 01:54:19,907 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 01:54:19,908 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 01:54:19,908 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 01:54:19,908 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 01:54:19,908 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 01:54:19,909 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 01:54:19,909 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 01:54:19,932 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-11-28 01:54:19,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 01:54:19,941 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 01:54:19,942 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-28 01:54:19,942 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-28 01:54:19,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 01:54:19,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1079717372, now seen corresponding path program 1 times [2019-11-28 01:54:19,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 01:54:19,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810045442] [2019-11-28 01:54:19,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 01:54:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 01:54:20,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 01:54:20,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810045442] [2019-11-28 01:54:20,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 01:54:20,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 01:54:20,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929733173] [2019-11-28 01:54:20,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 01:54:20,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 01:54:20,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 01:54:20,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 01:54:20,767 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 3 states. [2019-11-28 01:54:20,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 01:54:20,917 INFO L93 Difference]: Finished difference Result 366 states and 539 transitions. [2019-11-28 01:54:20,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 01:54:20,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-28 01:54:20,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 01:54:20,942 INFO L225 Difference]: With dead ends: 366 [2019-11-28 01:54:20,943 INFO L226 Difference]: Without dead ends: 217 [2019-11-28 01:54:20,949 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-28 01:54:20,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-11-28 01:54:21,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 203. [2019-11-28 01:54:21,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-11-28 01:54:21,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 290 transitions. [2019-11-28 01:54:21,035 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 290 transitions. Word has length 27 [2019-11-28 01:54:21,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 01:54:21,036 INFO L462 AbstractCegarLoop]: Abstraction has 203 states and 290 transitions. [2019-11-28 01:54:21,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 01:54:21,036 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 290 transitions. [2019-11-28 01:54:21,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 01:54:21,040 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 01:54:21,040 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-28 01:54:21,040 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-28 01:54:21,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 01:54:21,043 INFO L82 PathProgramCache]: Analyzing trace with hash -926810451, now seen corresponding path program 1 times [2019-11-28 01:54:21,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 01:54:21,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747555980] [2019-11-28 01:54:21,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 01:54:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 01:54:21,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 01:54:21,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747555980] [2019-11-28 01:54:21,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 01:54:21,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 01:54:21,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826979577] [2019-11-28 01:54:21,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 01:54:21,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 01:54:21,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 01:54:21,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 01:54:21,256 INFO L87 Difference]: Start difference. First operand 203 states and 290 transitions. Second operand 3 states. [2019-11-28 01:54:21,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 01:54:21,406 INFO L93 Difference]: Finished difference Result 544 states and 801 transitions. [2019-11-28 01:54:21,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 01:54:21,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-28 01:54:21,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 01:54:21,410 INFO L225 Difference]: With dead ends: 544 [2019-11-28 01:54:21,411 INFO L226 Difference]: Without dead ends: 359 [2019-11-28 01:54:21,416 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-28 01:54:21,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-11-28 01:54:21,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 355. [2019-11-28 01:54:21,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-11-28 01:54:21,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 522 transitions. [2019-11-28 01:54:21,447 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 522 transitions. Word has length 30 [2019-11-28 01:54:21,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 01:54:21,448 INFO L462 AbstractCegarLoop]: Abstraction has 355 states and 522 transitions. [2019-11-28 01:54:21,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 01:54:21,448 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 522 transitions. [2019-11-28 01:54:21,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 01:54:21,450 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 01:54:21,450 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-28 01:54:21,451 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-28 01:54:21,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 01:54:21,451 INFO L82 PathProgramCache]: Analyzing trace with hash -452402829, now seen corresponding path program 1 times [2019-11-28 01:54:21,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 01:54:21,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122135157] [2019-11-28 01:54:21,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 01:54:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 01:54:21,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 01:54:21,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122135157] [2019-11-28 01:54:21,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 01:54:21,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 01:54:21,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14714489] [2019-11-28 01:54:21,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 01:54:21,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 01:54:21,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 01:54:21,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 01:54:21,691 INFO L87 Difference]: Start difference. First operand 355 states and 522 transitions. Second operand 3 states. [2019-11-28 01:54:21,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 01:54:21,713 INFO L93 Difference]: Finished difference Result 355 states and 522 transitions. [2019-11-28 01:54:21,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 01:54:21,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-28 01:54:21,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 01:54:21,717 INFO L225 Difference]: With dead ends: 355 [2019-11-28 01:54:21,717 INFO L226 Difference]: Without dead ends: 353 [2019-11-28 01:54:21,719 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-28 01:54:21,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-11-28 01:54:21,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2019-11-28 01:54:21,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-11-28 01:54:21,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 520 transitions. [2019-11-28 01:54:21,763 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 520 transitions. Word has length 37 [2019-11-28 01:54:21,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 01:54:21,764 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 520 transitions. [2019-11-28 01:54:21,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 01:54:21,765 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 520 transitions. [2019-11-28 01:54:21,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-28 01:54:21,770 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 01:54:21,770 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-28 01:54:21,771 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-28 01:54:21,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 01:54:21,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1139579328, now seen corresponding path program 1 times [2019-11-28 01:54:21,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 01:54:21,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121460680] [2019-11-28 01:54:21,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 01:54:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 01:54:22,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 01:54:22,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121460680] [2019-11-28 01:54:22,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 01:54:22,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 01:54:22,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305043911] [2019-11-28 01:54:22,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 01:54:22,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 01:54:22,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 01:54:22,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 01:54:22,021 INFO L87 Difference]: Start difference. First operand 353 states and 520 transitions. Second operand 3 states. [2019-11-28 01:54:22,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 01:54:22,035 INFO L93 Difference]: Finished difference Result 353 states and 520 transitions. [2019-11-28 01:54:22,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 01:54:22,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-28 01:54:22,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 01:54:22,038 INFO L225 Difference]: With dead ends: 353 [2019-11-28 01:54:22,039 INFO L226 Difference]: Without dead ends: 351 [2019-11-28 01:54:22,041 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-28 01:54:22,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-11-28 01:54:22,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2019-11-28 01:54:22,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-11-28 01:54:22,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 518 transitions. [2019-11-28 01:54:22,063 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 518 transitions. Word has length 38 [2019-11-28 01:54:22,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 01:54:22,064 INFO L462 AbstractCegarLoop]: Abstraction has 351 states and 518 transitions. [2019-11-28 01:54:22,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 01:54:22,065 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 518 transitions. [2019-11-28 01:54:22,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 01:54:22,069 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 01:54:22,069 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-28 01:54:22,070 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-28 01:54:22,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 01:54:22,070 INFO L82 PathProgramCache]: Analyzing trace with hash -967214307, now seen corresponding path program 1 times [2019-11-28 01:54:22,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 01:54:22,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804249375] [2019-11-28 01:54:22,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 01:54:22,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 01:54:22,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 01:54:22,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804249375] [2019-11-28 01:54:22,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 01:54:22,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 01:54:22,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139551499] [2019-11-28 01:54:22,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 01:54:22,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 01:54:22,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 01:54:22,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 01:54:22,258 INFO L87 Difference]: Start difference. First operand 351 states and 518 transitions. Second operand 3 states. [2019-11-28 01:54:22,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 01:54:22,270 INFO L93 Difference]: Finished difference Result 351 states and 518 transitions. [2019-11-28 01:54:22,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 01:54:22,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-28 01:54:22,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 01:54:22,275 INFO L225 Difference]: With dead ends: 351 [2019-11-28 01:54:22,276 INFO L226 Difference]: Without dead ends: 349 [2019-11-28 01:54:22,277 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-28 01:54:22,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-11-28 01:54:22,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2019-11-28 01:54:22,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-11-28 01:54:22,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 516 transitions. [2019-11-28 01:54:22,291 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 516 transitions. Word has length 39 [2019-11-28 01:54:22,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 01:54:22,291 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 516 transitions. [2019-11-28 01:54:22,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 01:54:22,292 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 516 transitions. [2019-11-28 01:54:22,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-28 01:54:22,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 01:54:22,293 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-28 01:54:22,294 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-28 01:54:22,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 01:54:22,294 INFO L82 PathProgramCache]: Analyzing trace with hash 81134058, now seen corresponding path program 1 times [2019-11-28 01:54:22,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 01:54:22,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288288889] [2019-11-28 01:54:22,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 01:54:22,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 01:54:22,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 01:54:22,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288288889] [2019-11-28 01:54:22,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 01:54:22,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 01:54:22,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860129480] [2019-11-28 01:54:22,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 01:54:22,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 01:54:22,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 01:54:22,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 01:54:22,462 INFO L87 Difference]: Start difference. First operand 349 states and 516 transitions. Second operand 3 states. [2019-11-28 01:54:22,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 01:54:22,513 INFO L93 Difference]: Finished difference Result 1001 states and 1502 transitions. [2019-11-28 01:54:22,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 01:54:22,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-28 01:54:22,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 01:54:22,519 INFO L225 Difference]: With dead ends: 1001 [2019-11-28 01:54:22,519 INFO L226 Difference]: Without dead ends: 664 [2019-11-28 01:54:22,521 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-28 01:54:22,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2019-11-28 01:54:22,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 659. [2019-11-28 01:54:22,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-28 01:54:22,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 986 transitions. [2019-11-28 01:54:22,560 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 986 transitions. Word has length 40 [2019-11-28 01:54:22,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 01:54:22,563 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 986 transitions. [2019-11-28 01:54:22,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 01:54:22,564 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 986 transitions. [2019-11-28 01:54:22,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 01:54:22,572 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 01:54:22,572 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-28 01:54:22,573 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-28 01:54:22,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 01:54:22,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1376605001, now seen corresponding path program 1 times [2019-11-28 01:54:22,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 01:54:22,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140902113] [2019-11-28 01:54:22,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 01:54:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 01:54:22,827 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-28 01:54:22,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140902113] [2019-11-28 01:54:22,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 01:54:22,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 01:54:22,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240985228] [2019-11-28 01:54:22,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 01:54:22,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 01:54:22,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 01:54:22,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 01:54:22,833 INFO L87 Difference]: Start difference. First operand 659 states and 986 transitions. Second operand 3 states. [2019-11-28 01:54:22,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 01:54:22,953 INFO L93 Difference]: Finished difference Result 1300 states and 1953 transitions. [2019-11-28 01:54:22,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 01:54:22,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-28 01:54:22,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 01:54:22,959 INFO L225 Difference]: With dead ends: 1300 [2019-11-28 01:54:22,959 INFO L226 Difference]: Without dead ends: 659 [2019-11-28 01:54:22,960 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-28 01:54:22,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-11-28 01:54:22,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 658. [2019-11-28 01:54:22,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-11-28 01:54:22,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 981 transitions. [2019-11-28 01:54:22,993 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 981 transitions. Word has length 52 [2019-11-28 01:54:22,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 01:54:22,993 INFO L462 AbstractCegarLoop]: Abstraction has 658 states and 981 transitions. [2019-11-28 01:54:22,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 01:54:22,994 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 981 transitions. [2019-11-28 01:54:22,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 01:54:22,996 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 01:54:22,996 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-28 01:54:22,996 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-28 01:54:22,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 01:54:22,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1331921932, now seen corresponding path program 1 times [2019-11-28 01:54:22,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 01:54:22,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329617809] [2019-11-28 01:54:22,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 01:54:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 01:54:23,260 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-28 01:54:23,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329617809] [2019-11-28 01:54:23,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 01:54:23,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 01:54:23,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795470516] [2019-11-28 01:54:23,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 01:54:23,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 01:54:23,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 01:54:23,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 01:54:23,263 INFO L87 Difference]: Start difference. First operand 658 states and 981 transitions. Second operand 7 states. [2019-11-28 01:54:23,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 01:54:23,671 INFO L93 Difference]: Finished difference Result 2494 states and 3779 transitions. [2019-11-28 01:54:23,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 01:54:23,672 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-11-28 01:54:23,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 01:54:23,684 INFO L225 Difference]: With dead ends: 2494 [2019-11-28 01:54:23,684 INFO L226 Difference]: Without dead ends: 1854 [2019-11-28 01:54:23,686 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-28 01:54:23,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2019-11-28 01:54:23,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 659. [2019-11-28 01:54:23,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-28 01:54:23,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 981 transitions. [2019-11-28 01:54:23,753 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 981 transitions. Word has length 53 [2019-11-28 01:54:23,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 01:54:23,754 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 981 transitions. [2019-11-28 01:54:23,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 01:54:23,754 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 981 transitions. [2019-11-28 01:54:23,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-28 01:54:23,755 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 01:54:23,755 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-28 01:54:23,756 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-28 01:54:23,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 01:54:23,756 INFO L82 PathProgramCache]: Analyzing trace with hash 336433459, now seen corresponding path program 1 times [2019-11-28 01:54:23,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 01:54:23,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731414504] [2019-11-28 01:54:23,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 01:54:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 01:54:23,940 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-28 01:54:23,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731414504] [2019-11-28 01:54:23,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 01:54:23,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 01:54:23,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809257] [2019-11-28 01:54:23,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 01:54:23,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 01:54:23,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 01:54:23,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 01:54:23,942 INFO L87 Difference]: Start difference. First operand 659 states and 981 transitions. Second operand 5 states. [2019-11-28 01:54:24,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 01:54:24,027 INFO L93 Difference]: Finished difference Result 946 states and 1424 transitions. [2019-11-28 01:54:24,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 01:54:24,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-11-28 01:54:24,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 01:54:24,028 INFO L225 Difference]: With dead ends: 946 [2019-11-28 01:54:24,028 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 01:54:24,030 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-28 01:54:24,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 01:54:24,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 01:54:24,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 01:54:24,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 01:54:24,031 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2019-11-28 01:54:24,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 01:54:24,031 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 01:54:24,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 01:54:24,031 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 01:54:24,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 01:54:24,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 01:54:24,802 INFO L246 CegarLoopResult]: For program point L6014(line 6014) no Hoare annotation was computed. [2019-11-28 01:54:24,802 INFO L246 CegarLoopResult]: For program point L6113(line 6113) no Hoare annotation was computed. [2019-11-28 01:54:24,802 INFO L246 CegarLoopResult]: For program point L6080(lines 6080 6084) no Hoare annotation was computed. [2019-11-28 01:54:24,802 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 6319) no Hoare annotation was computed. [2019-11-28 01:54:24,803 INFO L242 CegarLoopResult]: At program point L6312(lines 1 7019) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-28 01:54:24,803 INFO L246 CegarLoopResult]: For program point L6114(lines 6114 6150) no Hoare annotation was computed. [2019-11-28 01:54:24,803 INFO L249 CegarLoopResult]: At program point L6213(lines 5965 6215) the Hoare annotation is: true [2019-11-28 01:54:24,803 INFO L246 CegarLoopResult]: For program point L6015(lines 6015 6030) no Hoare annotation was computed. [2019-11-28 01:54:24,803 INFO L242 CegarLoopResult]: At program point L7006(lines 7005 7007) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-28 01:54:24,804 INFO L242 CegarLoopResult]: At program point L5751(lines 5743 5753) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_6~0 0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-28 01:54:24,804 INFO L242 CegarLoopResult]: At program point L5751-1(lines 5743 5753) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_6~0 0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-28 01:54:24,804 INFO L242 CegarLoopResult]: At program point L5751-4(lines 5743 5753) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_6~0 0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-28 01:54:24,804 INFO L242 CegarLoopResult]: At program point L5751-5(lines 5743 5753) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_6~0 0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-28 01:54:24,804 INFO L242 CegarLoopResult]: At program point L5751-2(lines 5743 5753) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_6~0 0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-28 01:54:24,804 INFO L242 CegarLoopResult]: At program point L5751-3(lines 5743 5753) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_6~0 0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-28 01:54:24,809 INFO L242 CegarLoopResult]: At program point L5751-6(lines 5743 5753) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-28 01:54:24,809 INFO L246 CegarLoopResult]: For program point L6181(line 6181) no Hoare annotation was computed. [2019-11-28 01:54:24,809 INFO L242 CegarLoopResult]: At program point L6974(lines 6973 6975) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_6~0 0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-28 01:54:24,809 INFO L246 CegarLoopResult]: For program point L6842(lines 6842 6845) no Hoare annotation was computed. [2019-11-28 01:54:24,809 INFO L242 CegarLoopResult]: At program point L6908(lines 1 7019) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-28 01:54:24,809 INFO L246 CegarLoopResult]: For program point L6842-1(lines 6842 6845) no Hoare annotation was computed. [2019-11-28 01:54:24,809 INFO L246 CegarLoopResult]: For program point L6050(line 6050) no Hoare annotation was computed. [2019-11-28 01:54:24,810 INFO L246 CegarLoopResult]: For program point L6116(lines 6116 6147) no Hoare annotation was computed. [2019-11-28 01:54:24,810 INFO L246 CegarLoopResult]: For program point L6017(lines 6017 6027) no Hoare annotation was computed. [2019-11-28 01:54:24,810 INFO L242 CegarLoopResult]: At program point L6282(lines 6277 6284) the Hoare annotation is: (let ((.cse0 (= 1 ~ldv_mutex_lock~0)) (.cse1 (= 1 ~ldv_mutex_i_mutex_of_inode~0)) (.cse2 (= 1 ~ldv_mutex_mutex_of_device~0))) (or (and .cse0 .cse1 (<= 0 |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res|) .cse2 (= 2 ~ldv_mutex_udev~0) (= 0 |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res|)) (and .cse0 (= 1 ~ldv_mutex_udev~0) .cse1 (<= (+ |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res| 1) 0) (<= (+ |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res| 1) 0) .cse2 (<= (+ |ULTIMATE.start_ldv_undef_int_negative_#res| 1) 0) (<= (+ ULTIMATE.start_ldv_undef_int_negative_~ret~0 1) 0)))) [2019-11-28 01:54:24,810 INFO L246 CegarLoopResult]: For program point L6051(lines 6051 6111) no Hoare annotation was computed. [2019-11-28 01:54:24,810 INFO L246 CegarLoopResult]: For program point L6018(line 6018) no Hoare annotation was computed. [2019-11-28 01:54:24,810 INFO L246 CegarLoopResult]: For program point L6117(line 6117) no Hoare annotation was computed. [2019-11-28 01:54:24,810 INFO L246 CegarLoopResult]: For program point L6118(lines 6118 6123) no Hoare annotation was computed. [2019-11-28 01:54:24,811 INFO L246 CegarLoopResult]: For program point L6019(lines 6019 6023) no Hoare annotation was computed. [2019-11-28 01:54:24,811 INFO L242 CegarLoopResult]: At program point L7010(lines 7009 7011) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-28 01:54:24,811 INFO L246 CegarLoopResult]: For program point L6086(line 6086) no Hoare annotation was computed. [2019-11-28 01:54:24,811 INFO L246 CegarLoopResult]: For program point L6152(line 6152) no Hoare annotation was computed. [2019-11-28 01:54:24,811 INFO L242 CegarLoopResult]: At program point L6978(lines 6977 6979) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-28 01:54:24,811 INFO L246 CegarLoopResult]: For program point L6053(lines 6053 6108) no Hoare annotation was computed. [2019-11-28 01:54:24,811 INFO L246 CegarLoopResult]: For program point L6318(line 6318) no Hoare annotation was computed. [2019-11-28 01:54:24,811 INFO L246 CegarLoopResult]: For program point L6318-4(line 6318) no Hoare annotation was computed. [2019-11-28 01:54:24,812 INFO L246 CegarLoopResult]: For program point L6318-3(line 6318) no Hoare annotation was computed. [2019-11-28 01:54:24,813 INFO L246 CegarLoopResult]: For program point L6318-2(line 6318) no Hoare annotation was computed. [2019-11-28 01:54:24,813 INFO L246 CegarLoopResult]: For program point L6318-1(line 6318) no Hoare annotation was computed. [2019-11-28 01:54:24,813 INFO L246 CegarLoopResult]: For program point L6087(lines 6087 6094) no Hoare annotation was computed. [2019-11-28 01:54:24,813 INFO L246 CegarLoopResult]: For program point L6054(line 6054) no Hoare annotation was computed. [2019-11-28 01:54:24,814 INFO L246 CegarLoopResult]: For program point L6153(lines 6153 6168) no Hoare annotation was computed. [2019-11-28 01:54:24,814 INFO L246 CegarLoopResult]: For program point L6318-5(line 6318) no Hoare annotation was computed. [2019-11-28 01:54:24,814 INFO L242 CegarLoopResult]: At program point L6847(lines 6839 6849) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= 2 ~ldv_mutex_udev~0)) [2019-11-28 01:54:24,814 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 6319) no Hoare annotation was computed. [2019-11-28 01:54:24,814 INFO L246 CegarLoopResult]: For program point L6055(lines 6055 6063) no Hoare annotation was computed. [2019-11-28 01:54:24,814 INFO L246 CegarLoopResult]: For program point L6155(lines 6155 6165) no Hoare annotation was computed. [2019-11-28 01:54:24,814 INFO L246 CegarLoopResult]: For program point L6188(line 6188) no Hoare annotation was computed. [2019-11-28 01:54:24,814 INFO L242 CegarLoopResult]: At program point L7014(lines 7013 7015) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-28 01:54:24,815 INFO L246 CegarLoopResult]: For program point L6089(lines 6089 6092) no Hoare annotation was computed. [2019-11-28 01:54:24,815 INFO L242 CegarLoopResult]: At program point L5759(lines 5754 5761) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_6~0 0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-28 01:54:24,815 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 6319) no Hoare annotation was computed. [2019-11-28 01:54:24,816 INFO L246 CegarLoopResult]: For program point L6189(lines 6189 6204) no Hoare annotation was computed. [2019-11-28 01:54:24,816 INFO L246 CegarLoopResult]: For program point L6156(line 6156) no Hoare annotation was computed. [2019-11-28 01:54:24,816 INFO L246 CegarLoopResult]: For program point L6057(lines 6057 6061) no Hoare annotation was computed. [2019-11-28 01:54:24,816 INFO L242 CegarLoopResult]: At program point L5826(lines 5823 5828) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-28 01:54:24,816 INFO L242 CegarLoopResult]: At program point L5826-3(lines 5823 5828) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-28 01:54:24,816 INFO L242 CegarLoopResult]: At program point L5826-1(lines 5823 5828) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-28 01:54:24,816 INFO L242 CegarLoopResult]: At program point L5826-2(lines 5823 5828) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-28 01:54:24,817 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 6319) no Hoare annotation was computed. [2019-11-28 01:54:24,817 INFO L246 CegarLoopResult]: For program point L6157(lines 6157 6161) no Hoare annotation was computed. [2019-11-28 01:54:24,817 INFO L246 CegarLoopResult]: For program point L6025(line 6025) no Hoare annotation was computed. [2019-11-28 01:54:24,817 INFO L246 CegarLoopResult]: For program point L6191(lines 6191 6201) no Hoare annotation was computed. [2019-11-28 01:54:24,817 INFO L246 CegarLoopResult]: For program point L6125(line 6125) no Hoare annotation was computed. [2019-11-28 01:54:24,817 INFO L246 CegarLoopResult]: For program point L6951(lines 6950 6968) no Hoare annotation was computed. [2019-11-28 01:54:24,817 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 6319) no Hoare annotation was computed. [2019-11-28 01:54:24,817 INFO L246 CegarLoopResult]: For program point L6126(lines 6126 6143) no Hoare annotation was computed. [2019-11-28 01:54:24,818 INFO L246 CegarLoopResult]: For program point L6192(line 6192) no Hoare annotation was computed. [2019-11-28 01:54:24,818 INFO L246 CegarLoopResult]: For program point L6193(lines 6193 6197) no Hoare annotation was computed. [2019-11-28 01:54:24,818 INFO L242 CegarLoopResult]: At program point L5962(lines 5956 5964) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-28 01:54:24,818 INFO L246 CegarLoopResult]: For program point L6128-2(lines 6126 6142) no Hoare annotation was computed. [2019-11-28 01:54:24,818 INFO L246 CegarLoopResult]: For program point L6128(lines 6128 6136) no Hoare annotation was computed. [2019-11-28 01:54:24,818 INFO L246 CegarLoopResult]: For program point L6096(line 6096) no Hoare annotation was computed. [2019-11-28 01:54:24,818 INFO L246 CegarLoopResult]: For program point L6955(lines 6950 6968) no Hoare annotation was computed. [2019-11-28 01:54:24,818 INFO L246 CegarLoopResult]: For program point L6163(line 6163) no Hoare annotation was computed. [2019-11-28 01:54:24,819 INFO L246 CegarLoopResult]: For program point L6097(lines 6097 6104) no Hoare annotation was computed. [2019-11-28 01:54:24,819 INFO L242 CegarLoopResult]: At program point L5767(lines 5762 5769) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-28 01:54:24,819 INFO L242 CegarLoopResult]: At program point L5767-1(lines 5762 5769) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-28 01:54:24,819 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 01:54:24,819 INFO L246 CegarLoopResult]: For program point L6329-1(lines 6329 6332) no Hoare annotation was computed. [2019-11-28 01:54:24,819 INFO L246 CegarLoopResult]: For program point L6329(lines 6329 6332) no Hoare annotation was computed. [2019-11-28 01:54:24,819 INFO L246 CegarLoopResult]: For program point L6065(line 6065) no Hoare annotation was computed. [2019-11-28 01:54:24,819 INFO L246 CegarLoopResult]: For program point L6032(line 6032) no Hoare annotation was computed. [2019-11-28 01:54:24,820 INFO L246 CegarLoopResult]: For program point L6099(lines 6099 6102) no Hoare annotation was computed. [2019-11-28 01:54:24,820 INFO L246 CegarLoopResult]: For program point L6066(lines 6066 6071) no Hoare annotation was computed. [2019-11-28 01:54:24,820 INFO L242 CegarLoopResult]: At program point L6991(lines 6990 6992) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-28 01:54:24,820 INFO L246 CegarLoopResult]: For program point L6033(lines 6033 6048) no Hoare annotation was computed. [2019-11-28 01:54:24,820 INFO L246 CegarLoopResult]: For program point L6066-2(lines 6053 6108) no Hoare annotation was computed. [2019-11-28 01:54:24,820 INFO L246 CegarLoopResult]: For program point L6199(line 6199) no Hoare annotation was computed. [2019-11-28 01:54:24,820 INFO L246 CegarLoopResult]: For program point L6959(lines 6950 6968) no Hoare annotation was computed. [2019-11-28 01:54:24,820 INFO L246 CegarLoopResult]: For program point L6035(lines 6035 6045) no Hoare annotation was computed. [2019-11-28 01:54:24,821 INFO L242 CegarLoopResult]: At program point L6333(lines 6322 6335) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0) (<= (+ |ULTIMATE.start_ldv_undef_int_negative_#res| 1) 0) (<= (+ ULTIMATE.start_ldv_undef_int_negative_~ret~0 1) 0)) [2019-11-28 01:54:24,821 INFO L246 CegarLoopResult]: For program point L6036(line 6036) no Hoare annotation was computed. [2019-11-28 01:54:24,821 INFO L246 CegarLoopResult]: For program point L5838(lines 5838 5841) no Hoare annotation was computed. [2019-11-28 01:54:24,821 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 01:54:24,821 INFO L242 CegarLoopResult]: At program point L6995(lines 6994 6996) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-28 01:54:24,821 INFO L246 CegarLoopResult]: For program point L6037(lines 6037 6041) no Hoare annotation was computed. [2019-11-28 01:54:24,821 INFO L246 CegarLoopResult]: For program point L6170(line 6170) no Hoare annotation was computed. [2019-11-28 01:54:24,822 INFO L242 CegarLoopResult]: At program point L5939(lines 5934 5941) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-28 01:54:24,822 INFO L249 CegarLoopResult]: At program point L6963(lines 6948 6969) the Hoare annotation is: true [2019-11-28 01:54:24,822 INFO L246 CegarLoopResult]: For program point L6171(lines 6171 6186) no Hoare annotation was computed. [2019-11-28 01:54:24,823 INFO L242 CegarLoopResult]: At program point L6304(lines 6293 6306) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-28 01:54:24,823 INFO L242 CegarLoopResult]: At program point L6139(lines 6951 6954) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-28 01:54:24,823 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 01:54:24,823 INFO L246 CegarLoopResult]: For program point L6106(line 6106) no Hoare annotation was computed. [2019-11-28 01:54:24,823 INFO L246 CegarLoopResult]: For program point L6932(lines 6932 6938) no Hoare annotation was computed. [2019-11-28 01:54:24,823 INFO L246 CegarLoopResult]: For program point L6206(line 6206) no Hoare annotation was computed. [2019-11-28 01:54:24,823 INFO L246 CegarLoopResult]: For program point L6173(lines 6173 6183) no Hoare annotation was computed. [2019-11-28 01:54:24,824 INFO L242 CegarLoopResult]: At program point L6999(lines 6998 7000) the Hoare annotation is: (and (<= 0 ULTIMATE.start_m5632_recover_~r~0) (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (<= 0 |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res|) (= 1 ~ldv_mutex_mutex_of_device~0) (= 2 ~ldv_mutex_udev~0) (= 0 |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res|)) [2019-11-28 01:54:24,827 INFO L246 CegarLoopResult]: For program point L6174(line 6174) no Hoare annotation was computed. [2019-11-28 01:54:24,827 INFO L246 CegarLoopResult]: For program point L6175(lines 6175 6179) no Hoare annotation was computed. [2019-11-28 01:54:24,827 INFO L246 CegarLoopResult]: For program point L6043(line 6043) no Hoare annotation was computed. [2019-11-28 01:54:24,827 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 01:54:24,827 INFO L242 CegarLoopResult]: At program point L6209(lines 5988 6214) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-28 01:54:24,827 INFO L246 CegarLoopResult]: For program point L-1-1(line -1) no Hoare annotation was computed. [2019-11-28 01:54:24,828 INFO L246 CegarLoopResult]: For program point L-1-2(line -1) no Hoare annotation was computed. [2019-11-28 01:54:24,828 INFO L242 CegarLoopResult]: At program point L7002(lines 7001 7003) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-28 01:54:24,828 INFO L246 CegarLoopResult]: For program point L-1-3(line -1) no Hoare annotation was computed. [2019-11-28 01:54:24,828 INFO L246 CegarLoopResult]: For program point L-1-4(line -1) no Hoare annotation was computed. [2019-11-28 01:54:24,828 INFO L246 CegarLoopResult]: For program point L-1-5(line -1) no Hoare annotation was computed. [2019-11-28 01:54:24,828 INFO L246 CegarLoopResult]: For program point L-1-6(line -1) no Hoare annotation was computed. [2019-11-28 01:54:24,828 INFO L246 CegarLoopResult]: For program point L6903-1(lines 6903 6906) no Hoare annotation was computed. [2019-11-28 01:54:24,828 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6319) no Hoare annotation was computed. [2019-11-28 01:54:24,830 INFO L246 CegarLoopResult]: For program point L6903(lines 6903 6906) no Hoare annotation was computed. [2019-11-28 01:54:24,830 INFO L242 CegarLoopResult]: 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-28 01:54:24,830 INFO L246 CegarLoopResult]: For program point L-1-9(line -1) no Hoare annotation was computed. [2019-11-28 01:54:24,830 INFO L242 CegarLoopResult]: At program point L7002-1(lines 7001 7003) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_udev~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-28 01:54:24,830 INFO L246 CegarLoopResult]: For program point L-1-10(line -1) no Hoare annotation was computed. [2019-11-28 01:54:24,830 INFO L242 CegarLoopResult]: At program point L6937(lines 6926 6940) the Hoare annotation is: (let ((.cse0 (= 1 ~ldv_mutex_lock~0)) (.cse1 (= 1 ~ldv_mutex_i_mutex_of_inode~0)) (.cse2 (= 1 ~ldv_mutex_mutex_of_device~0))) (or (and .cse0 .cse1 .cse2 (= 2 ~ldv_mutex_udev~0) (= 0 |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res|)) (and .cse0 (= 1 ~ldv_mutex_udev~0) .cse1 (<= (+ |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res| 1) 0) .cse2 (<= (+ |ULTIMATE.start_ldv_undef_int_negative_#res| 1) 0) (<= (+ ULTIMATE.start_ldv_undef_int_negative_~ret~0 1) 0)))) [2019-11-28 01:54:24,831 INFO L249 CegarLoopResult]: At program point L5781-2(lines 5780 5783) the Hoare annotation is: true [2019-11-28 01:54:24,831 INFO L249 CegarLoopResult]: At program point L5781-3(lines 5780 5783) the Hoare annotation is: true [2019-11-28 01:54:24,831 INFO L249 CegarLoopResult]: At program point L5781(lines 5780 5783) the Hoare annotation is: true [2019-11-28 01:54:24,831 INFO L249 CegarLoopResult]: At program point L5781-1(lines 5780 5783) the Hoare annotation is: true [2019-11-28 01:54:24,831 INFO L249 CegarLoopResult]: At program point L5781-6(lines 5780 5783) the Hoare annotation is: true [2019-11-28 01:54:24,831 INFO L249 CegarLoopResult]: At program point L5781-7(lines 5780 5783) the Hoare annotation is: true [2019-11-28 01:54:24,831 INFO L249 CegarLoopResult]: At program point L5781-4(lines 5780 5783) the Hoare annotation is: true [2019-11-28 01:54:24,831 INFO L249 CegarLoopResult]: At program point L5781-5(lines 5780 5783) the Hoare annotation is: true [2019-11-28 01:54:24,832 INFO L249 CegarLoopResult]: At program point L5781-8(lines 5780 5783) the Hoare annotation is: true [2019-11-28 01:54:24,832 INFO L246 CegarLoopResult]: For program point L6079(line 6079) no Hoare annotation was computed. [2019-11-28 01:54:24,832 INFO L246 CegarLoopResult]: For program point L6145(line 6145) no Hoare annotation was computed. [2019-11-28 01:54:24,832 INFO L242 CegarLoopResult]: At program point L6971(lines 6970 6972) the Hoare annotation is: (and (<= 0 ULTIMATE.start_m5632_recover_~r~0) (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_i_mutex_of_inode~0) (<= 0 |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res|) (= 1 ~ldv_mutex_mutex_of_device~0) (= 2 ~ldv_mutex_udev~0) (= 0 |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res|)) [2019-11-28 01:54:24,832 INFO L246 CegarLoopResult]: For program point L6013(lines 6013 6208) no Hoare annotation was computed. [2019-11-28 01:54:24,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 01:54:24 BoogieIcfgContainer [2019-11-28 01:54:24,888 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 01:54:24,888 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 01:54:24,888 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 01:54:24,889 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 01:54:24,889 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:54:19" (3/4) ... [2019-11-28 01:54:24,894 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 01:54:24,939 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 50 nodes and edges [2019-11-28 01:54:24,942 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-11-28 01:54:24,944 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 01:54:24,946 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 01:54:24,949 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 01:54:25,001 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-28 01:54:25,001 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-28 01:54:25,001 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-28 01:54:25,001 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-28 01:54:25,003 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-28 01:54:25,367 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 01:54:25,367 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 01:54:25,370 INFO L168 Benchmark]: Toolchain (without parser) took 9435.80 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 350.2 MB). Free memory was 945.6 MB in the beginning and 907.8 MB in the end (delta: 37.8 MB). Peak memory consumption was 388.0 MB. Max. memory is 11.5 GB. [2019-11-28 01:54:25,370 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 01:54:25,371 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1946.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -112.6 MB). Peak memory consumption was 60.9 MB. Max. memory is 11.5 GB. [2019-11-28 01:54:25,371 INFO L168 Benchmark]: Boogie Procedure Inliner took 243.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-11-28 01:54:25,371 INFO L168 Benchmark]: Boogie Preprocessor took 184.69 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 01:54:25,372 INFO L168 Benchmark]: RCFGBuilder took 1528.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 839.6 MB in the end (delta: 198.5 MB). Peak memory consumption was 198.5 MB. Max. memory is 11.5 GB. [2019-11-28 01:54:25,372 INFO L168 Benchmark]: TraceAbstraction took 5049.25 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 189.8 MB). Free memory was 839.6 MB in the beginning and 1.1 GB in the end (delta: -242.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 01:54:25,373 INFO L168 Benchmark]: Witness Printer took 478.88 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 907.8 MB in the end (delta: 174.4 MB). Peak memory consumption was 174.4 MB. Max. memory is 11.5 GB. [2019-11-28 01:54:25,375 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1946.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -112.6 MB). Peak memory consumption was 60.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 243.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 184.69 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1528.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 839.6 MB in the end (delta: 198.5 MB). Peak memory consumption was 198.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5049.25 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 189.8 MB). Free memory was 839.6 MB in the beginning and 1.1 GB in the end (delta: -242.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 478.88 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 907.8 MB in the end (delta: 174.4 MB). Peak memory consumption was 174.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6319]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6319]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6319]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6319]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6319]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6319]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 5988]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 6293]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_0 == 1) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 6839]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && 2 == ldv_mutex_udev - InvariantResult [Line: 6277]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && 0 <= \result) && 1 == ldv_mutex_mutex_of_device) && 2 == ldv_mutex_udev) && 0 == \result) || (((((((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && \result + 1 <= 0) && \result + 1 <= 0) && 1 == ldv_mutex_mutex_of_device) && \result + 1 <= 0) && ret + 1 <= 0) - InvariantResult [Line: 5956]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_0 == 1) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5754]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_6 == 0) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 6926]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && 2 == ldv_mutex_udev) && 0 == \result) || ((((((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && \result + 1 <= 0) && 1 == ldv_mutex_mutex_of_device) && \result + 1 <= 0) && ret + 1 <= 0) - InvariantResult [Line: 5780]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6998]: Loop Invariant Derived loop invariant: (((((0 <= r && 1 == ldv_mutex_lock) && 1 == ldv_mutex_i_mutex_of_inode) && 0 <= \result) && 1 == ldv_mutex_mutex_of_device) && 2 == ldv_mutex_udev) && 0 == \result - InvariantResult [Line: 7009]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5762]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5743]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_6 == 0) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 7013]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5743]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_6 == 0) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5934]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_0 == 1) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5965]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5743]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_6 == 0) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 6948]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6973]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_6 == 0) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5762]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5743]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_0 == 1) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5743]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_6 == 0) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5823]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5780]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5780]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7001]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5823]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5743]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_6 == 0) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5823]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5743]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_6 == 0) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5823]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 6977]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5780]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6970]: Loop Invariant Derived loop invariant: (((((0 <= r && 1 == ldv_mutex_lock) && 1 == ldv_mutex_i_mutex_of_inode) && 0 <= \result) && 1 == ldv_mutex_mutex_of_device) && 2 == ldv_mutex_udev) && 0 == \result - InvariantResult [Line: 6951]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5780]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6990]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5780]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7001]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5780]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_6 == 0) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 6994]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && ldv_state_variable_0 == 1) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 7005]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 5780]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6322]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_udev) && 1 == ldv_mutex_i_mutex_of_inode) && 1 == ldv_mutex_mutex_of_device) && \result + 1 <= 0) && ret + 1 <= 0 - InvariantResult [Line: 5780]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 6 error locations. Result: SAFE, OverallTime: 4.1s, OverallIterations: 9, TraceHistogramMax: 3, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, 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.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 1219 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 48 LocationsWithAnnotation, 48 PreInvPairs, 203 NumberOfFragments, 634 HoareAnnotationTreeSize, 48 FomulaSimplifications, 10313 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 48 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.2s 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...