./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 173e3943 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 3acbab6b9aaee88273e5c2573b1301b2b4d4059e0d0ec0927c600e9ad855395b --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 16:44:40,262 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 16:44:40,264 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 16:44:40,321 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 16:44:40,321 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 16:44:40,324 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 16:44:40,325 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 16:44:40,326 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 16:44:40,328 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 16:44:40,331 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 16:44:40,332 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 16:44:40,333 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 16:44:40,333 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 16:44:40,335 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 16:44:40,337 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 16:44:40,340 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 16:44:40,341 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 16:44:40,342 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 16:44:40,343 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 16:44:40,345 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 16:44:40,347 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 16:44:40,348 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 16:44:40,349 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 16:44:40,350 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 16:44:40,353 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 16:44:40,356 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 16:44:40,356 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 16:44:40,356 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 16:44:40,357 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 16:44:40,358 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 16:44:40,358 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 16:44:40,359 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 16:44:40,359 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 16:44:40,360 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 16:44:40,361 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 16:44:40,361 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 16:44:40,363 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 16:44:40,363 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 16:44:40,363 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 16:44:40,363 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 16:44:40,364 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 16:44:40,365 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-06 16:44:40,387 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 16:44:40,388 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 16:44:40,388 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 16:44:40,388 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 16:44:40,389 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 16:44:40,389 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 16:44:40,390 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 16:44:40,390 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 16:44:40,390 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 16:44:40,390 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 16:44:40,391 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 16:44:40,391 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 16:44:40,391 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 16:44:40,391 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 16:44:40,391 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 16:44:40,391 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 16:44:40,392 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 16:44:40,392 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 16:44:40,392 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 16:44:40,392 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 16:44:40,392 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 16:44:40,392 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 16:44:40,392 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 16:44:40,393 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 16:44:40,393 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 16:44:40,393 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 16:44:40,393 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 16:44:40,394 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 16:44:40,394 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 16:44:40,394 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> 3acbab6b9aaee88273e5c2573b1301b2b4d4059e0d0ec0927c600e9ad855395b [2021-11-06 16:44:40,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 16:44:40,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 16:44:40,575 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 16:44:40,581 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 16:44:40,582 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 16:44:40,582 INFO L432 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 [2021-11-06 16:44:40,633 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22580157f/1957b742cd3f456daf44a34cf7d7c583/FLAG976669600 [2021-11-06 16:44:41,157 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 16:44:41,158 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 [2021-11-06 16:44:41,190 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22580157f/1957b742cd3f456daf44a34cf7d7c583/FLAG976669600 [2021-11-06 16:44:41,395 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22580157f/1957b742cd3f456daf44a34cf7d7c583 [2021-11-06 16:44:41,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 16:44:41,399 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 16:44:41,402 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 16:44:41,402 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 16:44:41,405 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 16:44:41,406 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 04:44:41" (1/1) ... [2021-11-06 16:44:41,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79b74619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 04:44:41, skipping insertion in model container [2021-11-06 16:44:41,407 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 04:44:41" (1/1) ... [2021-11-06 16:44:41,412 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 16:44:41,497 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 16:44:42,010 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /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[185252,185265] [2021-11-06 16:44:42,109 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 16:44:42,140 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 16:44:42,268 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /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[185252,185265] [2021-11-06 16:44:42,290 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 16:44:42,329 INFO L208 MainTranslator]: Completed translation [2021-11-06 16:44:42,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 04:44:42 WrapperNode [2021-11-06 16:44:42,330 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 16:44:42,332 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 16:44:42,332 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 16:44:42,332 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 16:44:42,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 04:44:42" (1/1) ... [2021-11-06 16:44:42,374 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 04:44:42" (1/1) ... [2021-11-06 16:44:42,434 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 16:44:42,434 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 16:44:42,435 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 16:44:42,435 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 16:44:42,440 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 04:44:42" (1/1) ... [2021-11-06 16:44:42,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 04:44:42" (1/1) ... [2021-11-06 16:44:42,450 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 04:44:42" (1/1) ... [2021-11-06 16:44:42,451 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 04:44:42" (1/1) ... [2021-11-06 16:44:42,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 04:44:42" (1/1) ... [2021-11-06 16:44:42,501 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 04:44:42" (1/1) ... [2021-11-06 16:44:42,506 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 04:44:42" (1/1) ... [2021-11-06 16:44:42,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 16:44:42,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 16:44:42,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 16:44:42,515 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 16:44:42,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 04:44:42" (1/1) ... [2021-11-06 16:44:42,520 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 16:44:42,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 16:44:42,556 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-06 16:44:42,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-06 16:44:42,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 16:44:42,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 16:44:42,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 16:44:42,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 16:44:42,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 16:44:42,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 16:44:42,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 16:44:42,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 16:44:42,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 16:44:43,697 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 16:44:43,697 INFO L299 CfgBuilder]: Removed 141 assume(true) statements. [2021-11-06 16:44:43,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 04:44:43 BoogieIcfgContainer [2021-11-06 16:44:43,699 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 16:44:43,700 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 16:44:43,700 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 16:44:43,702 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 16:44:43,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 04:44:41" (1/3) ... [2021-11-06 16:44:43,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@111f6d3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 04:44:43, skipping insertion in model container [2021-11-06 16:44:43,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 04:44:42" (2/3) ... [2021-11-06 16:44:43,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@111f6d3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 04:44:43, skipping insertion in model container [2021-11-06 16:44:43,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 04:44:43" (3/3) ... [2021-11-06 16:44:43,705 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point.cil.out.i [2021-11-06 16:44:43,710 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 16:44:43,710 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-11-06 16:44:43,742 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 16:44:43,746 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-06 16:44:43,746 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-11-06 16:44:43,755 INFO L276 IsEmpty]: Start isEmpty. Operand has 157 states, 150 states have (on average 1.5) internal successors, (225), 156 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 16:44:43,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-06 16:44:43,759 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 16:44:43,760 INFO L513 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] [2021-11-06 16:44:43,760 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 16:44:43,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 16:44:43,763 INFO L85 PathProgramCache]: Analyzing trace with hash 214162578, now seen corresponding path program 1 times [2021-11-06 16:44:43,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 16:44:43,768 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226836740] [2021-11-06 16:44:43,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 16:44:43,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 16:44:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 16:44:44,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 16:44:44,045 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 16:44:44,045 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226836740] [2021-11-06 16:44:44,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226836740] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 16:44:44,046 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 16:44:44,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 16:44:44,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39826149] [2021-11-06 16:44:44,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-06 16:44:44,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 16:44:44,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-06 16:44:44,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 16:44:44,058 INFO L87 Difference]: Start difference. First operand has 157 states, 150 states have (on average 1.5) internal successors, (225), 156 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 16:44:44,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 16:44:44,083 INFO L93 Difference]: Finished difference Result 310 states and 445 transitions. [2021-11-06 16:44:44,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-06 16:44:44,084 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-11-06 16:44:44,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 16:44:44,093 INFO L225 Difference]: With dead ends: 310 [2021-11-06 16:44:44,093 INFO L226 Difference]: Without dead ends: 144 [2021-11-06 16:44:44,096 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 16:44:44,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-11-06 16:44:44,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2021-11-06 16:44:44,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 138 states have (on average 1.3768115942028984) internal successors, (190), 143 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 16:44:44,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 190 transitions. [2021-11-06 16:44:44,121 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 190 transitions. Word has length 39 [2021-11-06 16:44:44,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 16:44:44,121 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 190 transitions. [2021-11-06 16:44:44,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 16:44:44,122 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 190 transitions. [2021-11-06 16:44:44,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-06 16:44:44,123 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 16:44:44,123 INFO L513 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] [2021-11-06 16:44:44,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 16:44:44,123 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 16:44:44,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 16:44:44,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1366579640, now seen corresponding path program 1 times [2021-11-06 16:44:44,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 16:44:44,124 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089404459] [2021-11-06 16:44:44,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 16:44:44,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 16:44:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 16:44:44,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 16:44:44,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 16:44:44,294 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089404459] [2021-11-06 16:44:44,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089404459] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 16:44:44,295 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 16:44:44,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 16:44:44,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841807159] [2021-11-06 16:44:44,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 16:44:44,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 16:44:44,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 16:44:44,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 16:44:44,298 INFO L87 Difference]: Start difference. First operand 144 states and 190 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 16:44:44,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 16:44:44,370 INFO L93 Difference]: Finished difference Result 347 states and 479 transitions. [2021-11-06 16:44:44,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 16:44:44,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-11-06 16:44:44,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 16:44:44,375 INFO L225 Difference]: With dead ends: 347 [2021-11-06 16:44:44,375 INFO L226 Difference]: Without dead ends: 233 [2021-11-06 16:44:44,383 INFO L786 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 [2021-11-06 16:44:44,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-11-06 16:44:44,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 219. [2021-11-06 16:44:44,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 213 states have (on average 1.4366197183098592) internal successors, (306), 218 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 16:44:44,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 306 transitions. [2021-11-06 16:44:44,399 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 306 transitions. Word has length 39 [2021-11-06 16:44:44,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 16:44:44,399 INFO L470 AbstractCegarLoop]: Abstraction has 219 states and 306 transitions. [2021-11-06 16:44:44,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 16:44:44,400 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 306 transitions. [2021-11-06 16:44:44,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-06 16:44:44,405 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 16:44:44,405 INFO L513 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, 1, 1] [2021-11-06 16:44:44,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 16:44:44,406 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 16:44:44,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 16:44:44,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1555974485, now seen corresponding path program 1 times [2021-11-06 16:44:44,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 16:44:44,410 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969123128] [2021-11-06 16:44:44,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 16:44:44,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 16:44:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 16:44:44,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 16:44:44,568 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 16:44:44,568 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969123128] [2021-11-06 16:44:44,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969123128] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 16:44:44,568 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 16:44:44,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 16:44:44,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391622115] [2021-11-06 16:44:44,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 16:44:44,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 16:44:44,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 16:44:44,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 16:44:44,575 INFO L87 Difference]: Start difference. First operand 219 states and 306 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 16:44:44,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 16:44:44,644 INFO L93 Difference]: Finished difference Result 564 states and 821 transitions. [2021-11-06 16:44:44,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 16:44:44,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-06 16:44:44,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 16:44:44,646 INFO L225 Difference]: With dead ends: 564 [2021-11-06 16:44:44,646 INFO L226 Difference]: Without dead ends: 375 [2021-11-06 16:44:44,647 INFO L786 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 [2021-11-06 16:44:44,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2021-11-06 16:44:44,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 371. [2021-11-06 16:44:44,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 365 states have (on average 1.473972602739726) internal successors, (538), 370 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 16:44:44,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 538 transitions. [2021-11-06 16:44:44,668 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 538 transitions. Word has length 42 [2021-11-06 16:44:44,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 16:44:44,668 INFO L470 AbstractCegarLoop]: Abstraction has 371 states and 538 transitions. [2021-11-06 16:44:44,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 16:44:44,669 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 538 transitions. [2021-11-06 16:44:44,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-06 16:44:44,670 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 16:44:44,670 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 16:44:44,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 16:44:44,671 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 16:44:44,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 16:44:44,671 INFO L85 PathProgramCache]: Analyzing trace with hash 819401089, now seen corresponding path program 1 times [2021-11-06 16:44:44,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 16:44:44,672 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696699159] [2021-11-06 16:44:44,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 16:44:44,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 16:44:44,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 16:44:44,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 16:44:44,793 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 16:44:44,796 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696699159] [2021-11-06 16:44:44,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696699159] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 16:44:44,796 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 16:44:44,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 16:44:44,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762305232] [2021-11-06 16:44:44,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 16:44:44,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 16:44:44,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 16:44:44,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 16:44:44,797 INFO L87 Difference]: Start difference. First operand 371 states and 538 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 16:44:44,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 16:44:44,814 INFO L93 Difference]: Finished difference Result 371 states and 538 transitions. [2021-11-06 16:44:44,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 16:44:44,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-11-06 16:44:44,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 16:44:44,816 INFO L225 Difference]: With dead ends: 371 [2021-11-06 16:44:44,816 INFO L226 Difference]: Without dead ends: 369 [2021-11-06 16:44:44,816 INFO L786 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 [2021-11-06 16:44:44,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2021-11-06 16:44:44,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2021-11-06 16:44:44,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 364 states have (on average 1.4725274725274726) internal successors, (536), 368 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 16:44:44,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 536 transitions. [2021-11-06 16:44:44,828 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 536 transitions. Word has length 51 [2021-11-06 16:44:44,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 16:44:44,828 INFO L470 AbstractCegarLoop]: Abstraction has 369 states and 536 transitions. [2021-11-06 16:44:44,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 16:44:44,828 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 536 transitions. [2021-11-06 16:44:44,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-06 16:44:44,829 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 16:44:44,829 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 16:44:44,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-06 16:44:44,829 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 16:44:44,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 16:44:44,830 INFO L85 PathProgramCache]: Analyzing trace with hash -368363485, now seen corresponding path program 1 times [2021-11-06 16:44:44,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 16:44:44,830 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609909543] [2021-11-06 16:44:44,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 16:44:44,830 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 16:44:44,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 16:44:44,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 16:44:44,954 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 16:44:44,954 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609909543] [2021-11-06 16:44:44,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609909543] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 16:44:44,957 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 16:44:44,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 16:44:44,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048276544] [2021-11-06 16:44:44,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 16:44:44,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 16:44:44,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 16:44:44,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 16:44:44,959 INFO L87 Difference]: Start difference. First operand 369 states and 536 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 16:44:44,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 16:44:44,963 INFO L93 Difference]: Finished difference Result 369 states and 536 transitions. [2021-11-06 16:44:44,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 16:44:44,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-11-06 16:44:44,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 16:44:44,965 INFO L225 Difference]: With dead ends: 369 [2021-11-06 16:44:44,966 INFO L226 Difference]: Without dead ends: 367 [2021-11-06 16:44:44,966 INFO L786 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 [2021-11-06 16:44:44,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2021-11-06 16:44:44,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2021-11-06 16:44:44,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 363 states have (on average 1.4710743801652892) internal successors, (534), 366 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 16:44:44,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 534 transitions. [2021-11-06 16:44:44,975 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 534 transitions. Word has length 52 [2021-11-06 16:44:44,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 16:44:44,975 INFO L470 AbstractCegarLoop]: Abstraction has 367 states and 534 transitions. [2021-11-06 16:44:44,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 16:44:44,976 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 534 transitions. [2021-11-06 16:44:44,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-06 16:44:44,977 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 16:44:44,977 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 16:44:44,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-06 16:44:44,978 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 16:44:44,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 16:44:44,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1465640395, now seen corresponding path program 1 times [2021-11-06 16:44:44,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 16:44:44,978 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43477630] [2021-11-06 16:44:44,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 16:44:44,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 16:44:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 16:44:45,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 16:44:45,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 16:44:45,079 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43477630] [2021-11-06 16:44:45,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43477630] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 16:44:45,079 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 16:44:45,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 16:44:45,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372194818] [2021-11-06 16:44:45,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 16:44:45,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 16:44:45,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 16:44:45,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 16:44:45,081 INFO L87 Difference]: Start difference. First operand 367 states and 534 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 16:44:45,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 16:44:45,086 INFO L93 Difference]: Finished difference Result 367 states and 534 transitions. [2021-11-06 16:44:45,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 16:44:45,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-11-06 16:44:45,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 16:44:45,088 INFO L225 Difference]: With dead ends: 367 [2021-11-06 16:44:45,088 INFO L226 Difference]: Without dead ends: 365 [2021-11-06 16:44:45,088 INFO L786 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 [2021-11-06 16:44:45,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-11-06 16:44:45,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2021-11-06 16:44:45,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 362 states have (on average 1.4696132596685083) internal successors, (532), 364 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 16:44:45,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 532 transitions. [2021-11-06 16:44:45,095 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 532 transitions. Word has length 53 [2021-11-06 16:44:45,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 16:44:45,095 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 532 transitions. [2021-11-06 16:44:45,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 16:44:45,095 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 532 transitions. [2021-11-06 16:44:45,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-06 16:44:45,096 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 16:44:45,096 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 16:44:45,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-06 16:44:45,096 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 16:44:45,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 16:44:45,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1809781459, now seen corresponding path program 1 times [2021-11-06 16:44:45,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 16:44:45,097 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155375344] [2021-11-06 16:44:45,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 16:44:45,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 16:44:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 16:44:45,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 16:44:45,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 16:44:45,192 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155375344] [2021-11-06 16:44:45,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155375344] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 16:44:45,192 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 16:44:45,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 16:44:45,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864724911] [2021-11-06 16:44:45,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 16:44:45,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 16:44:45,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 16:44:45,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 16:44:45,194 INFO L87 Difference]: Start difference. First operand 365 states and 532 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 16:44:45,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 16:44:45,212 INFO L93 Difference]: Finished difference Result 1025 states and 1526 transitions. [2021-11-06 16:44:45,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 16:44:45,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-11-06 16:44:45,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 16:44:45,215 INFO L225 Difference]: With dead ends: 1025 [2021-11-06 16:44:45,215 INFO L226 Difference]: Without dead ends: 684 [2021-11-06 16:44:45,216 INFO L786 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 [2021-11-06 16:44:45,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2021-11-06 16:44:45,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 679. [2021-11-06 16:44:45,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 676 states have (on average 1.4881656804733727) internal successors, (1006), 678 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 16:44:45,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 1006 transitions. [2021-11-06 16:44:45,227 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 1006 transitions. Word has length 54 [2021-11-06 16:44:45,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 16:44:45,228 INFO L470 AbstractCegarLoop]: Abstraction has 679 states and 1006 transitions. [2021-11-06 16:44:45,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 16:44:45,229 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 1006 transitions. [2021-11-06 16:44:45,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-06 16:44:45,229 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 16:44:45,229 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 16:44:45,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-06 16:44:45,230 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 16:44:45,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 16:44:45,230 INFO L85 PathProgramCache]: Analyzing trace with hash -454066381, now seen corresponding path program 1 times [2021-11-06 16:44:45,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 16:44:45,231 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953855648] [2021-11-06 16:44:45,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 16:44:45,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 16:44:45,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 16:44:45,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 16:44:45,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 16:44:45,316 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953855648] [2021-11-06 16:44:45,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953855648] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 16:44:45,317 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 16:44:45,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 16:44:45,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854239898] [2021-11-06 16:44:45,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 16:44:45,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 16:44:45,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 16:44:45,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 16:44:45,319 INFO L87 Difference]: Start difference. First operand 679 states and 1006 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 16:44:45,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 16:44:45,375 INFO L93 Difference]: Finished difference Result 1328 states and 1981 transitions. [2021-11-06 16:44:45,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 16:44:45,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-11-06 16:44:45,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 16:44:45,381 INFO L225 Difference]: With dead ends: 1328 [2021-11-06 16:44:45,381 INFO L226 Difference]: Without dead ends: 679 [2021-11-06 16:44:45,382 INFO L786 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 [2021-11-06 16:44:45,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2021-11-06 16:44:45,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 678. [2021-11-06 16:44:45,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 675 states have (on average 1.482962962962963) internal successors, (1001), 677 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 16:44:45,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 1001 transitions. [2021-11-06 16:44:45,397 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 1001 transitions. Word has length 66 [2021-11-06 16:44:45,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 16:44:45,397 INFO L470 AbstractCegarLoop]: Abstraction has 678 states and 1001 transitions. [2021-11-06 16:44:45,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 16:44:45,398 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1001 transitions. [2021-11-06 16:44:45,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-06 16:44:45,398 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 16:44:45,399 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 16:44:45,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-06 16:44:45,399 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 16:44:45,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 16:44:45,399 INFO L85 PathProgramCache]: Analyzing trace with hash -134151878, now seen corresponding path program 1 times [2021-11-06 16:44:45,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 16:44:45,400 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891301358] [2021-11-06 16:44:45,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 16:44:45,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 16:44:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 16:44:45,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 16:44:45,531 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 16:44:45,531 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891301358] [2021-11-06 16:44:45,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891301358] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 16:44:45,531 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 16:44:45,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 16:44:45,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904844093] [2021-11-06 16:44:45,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 16:44:45,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 16:44:45,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 16:44:45,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-06 16:44:45,533 INFO L87 Difference]: Start difference. First operand 678 states and 1001 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 16:44:45,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 16:44:45,643 INFO L93 Difference]: Finished difference Result 2538 states and 3823 transitions. [2021-11-06 16:44:45,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 16:44:45,643 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-11-06 16:44:45,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 16:44:45,649 INFO L225 Difference]: With dead ends: 2538 [2021-11-06 16:44:45,649 INFO L226 Difference]: Without dead ends: 1890 [2021-11-06 16:44:45,650 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-06 16:44:45,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1890 states. [2021-11-06 16:44:45,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1890 to 679. [2021-11-06 16:44:45,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 677 states have (on average 1.4785819793205317) internal successors, (1001), 678 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 16:44:45,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 1001 transitions. [2021-11-06 16:44:45,671 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 1001 transitions. Word has length 67 [2021-11-06 16:44:45,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 16:44:45,672 INFO L470 AbstractCegarLoop]: Abstraction has 679 states and 1001 transitions. [2021-11-06 16:44:45,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 16:44:45,672 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 1001 transitions. [2021-11-06 16:44:45,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-06 16:44:45,673 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 16:44:45,673 INFO L513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 16:44:45,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-06 16:44:45,673 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-11-06 16:44:45,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 16:44:45,674 INFO L85 PathProgramCache]: Analyzing trace with hash -466045329, now seen corresponding path program 1 times [2021-11-06 16:44:45,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 16:44:45,674 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492455024] [2021-11-06 16:44:45,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 16:44:45,674 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 16:44:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 16:44:45,758 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 16:44:45,758 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 16:44:45,758 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492455024] [2021-11-06 16:44:45,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492455024] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 16:44:45,759 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 16:44:45,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 16:44:45,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430448281] [2021-11-06 16:44:45,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 16:44:45,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 16:44:45,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 16:44:45,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 16:44:45,760 INFO L87 Difference]: Start difference. First operand 679 states and 1001 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 16:44:45,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 16:44:45,795 INFO L93 Difference]: Finished difference Result 970 states and 1448 transitions. [2021-11-06 16:44:45,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 16:44:45,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-11-06 16:44:45,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 16:44:45,796 INFO L225 Difference]: With dead ends: 970 [2021-11-06 16:44:45,796 INFO L226 Difference]: Without dead ends: 0 [2021-11-06 16:44:45,797 INFO L786 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 [2021-11-06 16:44:45,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-06 16:44:45,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-06 16:44:45,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 16:44:45,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-06 16:44:45,798 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 72 [2021-11-06 16:44:45,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 16:44:45,798 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-06 16:44:45,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 16:44:45,798 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-06 16:44:45,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-06 16:44:45,800 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 16:44:45,801 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 16:44:45,801 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 16:44:45,801 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 16:44:45,801 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 16:44:45,801 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 16:44:45,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-06 16:44:45,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-06 16:44:45,807 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,821 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,837 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,852 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,859 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,861 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,863 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,871 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,871 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,881 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,881 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,890 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,891 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,891 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,899 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,902 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,906 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,911 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,911 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,922 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,926 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,939 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:45,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 16:44:46,213 INFO L857 garLoopResultBuilder]: For program point L6047(lines 6047 6062) no Hoare annotation was computed. [2021-11-06 16:44:46,214 INFO L857 garLoopResultBuilder]: For program point L6080-2(lines 6067 6122) no Hoare annotation was computed. [2021-11-06 16:44:46,214 INFO L857 garLoopResultBuilder]: For program point L6113(lines 6113 6116) no Hoare annotation was computed. [2021-11-06 16:44:46,214 INFO L857 garLoopResultBuilder]: For program point L6080(lines 6080 6085) no Hoare annotation was computed. [2021-11-06 16:44:46,214 INFO L853 garLoopResultBuilder]: At program point L7005(lines 7004 7006) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2021-11-06 16:44:46,214 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 6333) no Hoare annotation was computed. [2021-11-06 16:44:46,215 INFO L857 garLoopResultBuilder]: For program point L6213(line 6213) no Hoare annotation was computed. [2021-11-06 16:44:46,215 INFO L857 garLoopResultBuilder]: For program point L6973(lines 6964 6982) no Hoare annotation was computed. [2021-11-06 16:44:46,215 INFO L857 garLoopResultBuilder]: For program point L6049(lines 6049 6059) no Hoare annotation was computed. [2021-11-06 16:44:46,215 INFO L853 garLoopResultBuilder]: At program point L6347(lines 6336 6349) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (<= (+ |ULTIMATE.start_ldv_undef_int_negative_#res| 1) 0) (<= (+ ULTIMATE.start_ldv_undef_int_negative_~ret~0 1) 0) (= ~ldv_mutex_udev~0 1)) [2021-11-06 16:44:46,215 INFO L857 garLoopResultBuilder]: For program point L6050(line 6050) no Hoare annotation was computed. [2021-11-06 16:44:46,215 INFO L857 garLoopResultBuilder]: For program point L5852(lines 5852 5855) no Hoare annotation was computed. [2021-11-06 16:44:46,215 INFO L857 garLoopResultBuilder]: For program point L5720-1(lines 5720 5722) no Hoare annotation was computed. [2021-11-06 16:44:46,216 INFO L857 garLoopResultBuilder]: For program point L5720-2(lines 5720 5722) no Hoare annotation was computed. [2021-11-06 16:44:46,216 INFO L857 garLoopResultBuilder]: For program point L5720(lines 5720 5722) no Hoare annotation was computed. [2021-11-06 16:44:46,216 INFO L857 garLoopResultBuilder]: For program point L5720-5(lines 5720 5722) no Hoare annotation was computed. [2021-11-06 16:44:46,216 INFO L857 garLoopResultBuilder]: For program point L5720-6(lines 5720 5722) no Hoare annotation was computed. [2021-11-06 16:44:46,216 INFO L857 garLoopResultBuilder]: For program point L5720-3(lines 5720 5722) no Hoare annotation was computed. [2021-11-06 16:44:46,216 INFO L857 garLoopResultBuilder]: For program point L5720-4(lines 5720 5722) no Hoare annotation was computed. [2021-11-06 16:44:46,216 INFO L857 garLoopResultBuilder]: For program point L6051(lines 6051 6055) no Hoare annotation was computed. [2021-11-06 16:44:46,216 INFO L853 garLoopResultBuilder]: At program point L7009(lines 7008 7010) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2021-11-06 16:44:46,217 INFO L857 garLoopResultBuilder]: For program point L5721-2(line 5721) no Hoare annotation was computed. [2021-11-06 16:44:46,217 INFO L857 garLoopResultBuilder]: For program point L5721(line 5721) no Hoare annotation was computed. [2021-11-06 16:44:46,217 INFO L857 garLoopResultBuilder]: For program point L5721-6(line 5721) no Hoare annotation was computed. [2021-11-06 16:44:46,217 INFO L857 garLoopResultBuilder]: For program point L5721-4(line 5721) no Hoare annotation was computed. [2021-11-06 16:44:46,217 INFO L857 garLoopResultBuilder]: For program point L5721-10(line 5721) no Hoare annotation was computed. [2021-11-06 16:44:46,217 INFO L857 garLoopResultBuilder]: For program point L5721-8(line 5721) no Hoare annotation was computed. [2021-11-06 16:44:46,217 INFO L857 garLoopResultBuilder]: For program point L5721-12(line 5721) no Hoare annotation was computed. [2021-11-06 16:44:46,217 INFO L857 garLoopResultBuilder]: For program point L6184(line 6184) no Hoare annotation was computed. [2021-11-06 16:44:46,218 INFO L853 garLoopResultBuilder]: At program point L5953(lines 5948 5955) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2021-11-06 16:44:46,218 INFO L860 garLoopResultBuilder]: At program point L6977(lines 6962 6983) the Hoare annotation is: true [2021-11-06 16:44:46,218 INFO L857 garLoopResultBuilder]: For program point L6185(lines 6185 6200) no Hoare annotation was computed. [2021-11-06 16:44:46,218 INFO L853 garLoopResultBuilder]: At program point L6318(lines 6307 6320) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2021-11-06 16:44:46,218 INFO L853 garLoopResultBuilder]: At program point L6153(lines 6965 6968) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2021-11-06 16:44:46,218 INFO L857 garLoopResultBuilder]: For program point L6120(line 6120) no Hoare annotation was computed. [2021-11-06 16:44:46,218 INFO L857 garLoopResultBuilder]: For program point L6946(lines 6946 6952) no Hoare annotation was computed. [2021-11-06 16:44:46,219 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 6333) no Hoare annotation was computed. [2021-11-06 16:44:46,219 INFO L857 garLoopResultBuilder]: For program point L6187(lines 6187 6197) no Hoare annotation was computed. [2021-11-06 16:44:46,219 INFO L857 garLoopResultBuilder]: For program point L6220(line 6220) no Hoare annotation was computed. [2021-11-06 16:44:46,219 INFO L853 garLoopResultBuilder]: At program point L7013(lines 7012 7014) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ULTIMATE.start_m5632_recover_~r~0 0) (= ~ldv_mutex_lock~0 1) (= 2 ~ldv_mutex_udev~0) (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res| 0) (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res| 0)) [2021-11-06 16:44:46,219 INFO L857 garLoopResultBuilder]: For program point L6188(line 6188) no Hoare annotation was computed. [2021-11-06 16:44:46,219 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 6333) no Hoare annotation was computed. [2021-11-06 16:44:46,220 INFO L857 garLoopResultBuilder]: For program point L6189(lines 6189 6193) no Hoare annotation was computed. [2021-11-06 16:44:46,220 INFO L857 garLoopResultBuilder]: For program point L6057(line 6057) no Hoare annotation was computed. [2021-11-06 16:44:46,220 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 6333) no Hoare annotation was computed. [2021-11-06 16:44:46,220 INFO L853 garLoopResultBuilder]: At program point L6223(lines 6002 6228) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2021-11-06 16:44:46,220 INFO L853 garLoopResultBuilder]: At program point L7016-1(lines 7015 7017) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2021-11-06 16:44:46,220 INFO L853 garLoopResultBuilder]: At program point L7016(lines 7015 7017) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2021-11-06 16:44:46,220 INFO L857 garLoopResultBuilder]: For program point L6917-1(lines 6917 6920) no Hoare annotation was computed. [2021-11-06 16:44:46,221 INFO L857 garLoopResultBuilder]: For program point L6917(lines 6917 6920) no Hoare annotation was computed. [2021-11-06 16:44:46,221 INFO L853 garLoopResultBuilder]: At program point L6951(lines 6940 6954) the Hoare annotation is: (let ((.cse0 (= 1 ~ldv_mutex_mutex_of_device~0)) (.cse1 (= ~ldv_mutex_i_mutex_of_inode~0 1)) (.cse2 (= ~ldv_mutex_lock~0 1))) (or (and .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res| 1) 0) (<= (+ |ULTIMATE.start_ldv_undef_int_negative_#res| 1) 0) (<= (+ ULTIMATE.start_ldv_undef_int_negative_~ret~0 1) 0) (= ~ldv_mutex_udev~0 1)) (and .cse0 .cse1 .cse2 (= 2 ~ldv_mutex_udev~0) (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res| 0)))) [2021-11-06 16:44:46,221 INFO L860 garLoopResultBuilder]: At program point L5795(lines 5794 5797) the Hoare annotation is: true [2021-11-06 16:44:46,221 INFO L860 garLoopResultBuilder]: At program point L5795-1(lines 5794 5797) the Hoare annotation is: true [2021-11-06 16:44:46,221 INFO L860 garLoopResultBuilder]: At program point L5795-4(lines 5794 5797) the Hoare annotation is: true [2021-11-06 16:44:46,222 INFO L860 garLoopResultBuilder]: At program point L5795-5(lines 5794 5797) the Hoare annotation is: true [2021-11-06 16:44:46,222 INFO L860 garLoopResultBuilder]: At program point L5795-2(lines 5794 5797) the Hoare annotation is: true [2021-11-06 16:44:46,222 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 6333) no Hoare annotation was computed. [2021-11-06 16:44:46,222 INFO L860 garLoopResultBuilder]: At program point L5795-3(lines 5794 5797) the Hoare annotation is: true [2021-11-06 16:44:46,222 INFO L860 garLoopResultBuilder]: At program point L5795-8(lines 5794 5797) the Hoare annotation is: true [2021-11-06 16:44:46,223 INFO L860 garLoopResultBuilder]: At program point L5795-6(lines 5794 5797) the Hoare annotation is: true [2021-11-06 16:44:46,223 INFO L860 garLoopResultBuilder]: At program point L5795-7(lines 5794 5797) the Hoare annotation is: true [2021-11-06 16:44:46,223 INFO L857 garLoopResultBuilder]: For program point L6159(line 6159) no Hoare annotation was computed. [2021-11-06 16:44:46,223 INFO L857 garLoopResultBuilder]: For program point L6027(lines 6027 6222) no Hoare annotation was computed. [2021-11-06 16:44:46,223 INFO L857 garLoopResultBuilder]: For program point L6093(line 6093) no Hoare annotation was computed. [2021-11-06 16:44:46,223 INFO L853 garLoopResultBuilder]: At program point L6985(lines 6984 6986) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ULTIMATE.start_m5632_recover_~r~0 0) (= ~ldv_mutex_lock~0 1) (= 2 ~ldv_mutex_udev~0) (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res| 0) (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res| 0)) [2021-11-06 16:44:46,223 INFO L857 garLoopResultBuilder]: For program point L6127(line 6127) no Hoare annotation was computed. [2021-11-06 16:44:46,224 INFO L857 garLoopResultBuilder]: For program point L6094(lines 6094 6098) no Hoare annotation was computed. [2021-11-06 16:44:46,224 INFO L857 garLoopResultBuilder]: For program point L6028(line 6028) no Hoare annotation was computed. [2021-11-06 16:44:46,224 INFO L853 garLoopResultBuilder]: At program point L6326(lines 1 7033) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2021-11-06 16:44:46,224 INFO L860 garLoopResultBuilder]: At program point L6227(lines 5979 6229) the Hoare annotation is: true [2021-11-06 16:44:46,224 INFO L857 garLoopResultBuilder]: For program point L6128(lines 6128 6164) no Hoare annotation was computed. [2021-11-06 16:44:46,224 INFO L857 garLoopResultBuilder]: For program point L6029(lines 6029 6044) no Hoare annotation was computed. [2021-11-06 16:44:46,224 INFO L853 garLoopResultBuilder]: At program point L7020(lines 7019 7021) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2021-11-06 16:44:46,225 INFO L853 garLoopResultBuilder]: At program point L5765-2(lines 5757 5767) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1)) [2021-11-06 16:44:46,225 INFO L853 garLoopResultBuilder]: At program point L5765-3(lines 5757 5767) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1)) [2021-11-06 16:44:46,225 INFO L853 garLoopResultBuilder]: At program point L5765(lines 5757 5767) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1)) [2021-11-06 16:44:46,225 INFO L853 garLoopResultBuilder]: At program point L5765-1(lines 5757 5767) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1)) [2021-11-06 16:44:46,226 INFO L853 garLoopResultBuilder]: At program point L5765-6(lines 5757 5767) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2021-11-06 16:44:46,226 INFO L853 garLoopResultBuilder]: At program point L5765-4(lines 5757 5767) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1)) [2021-11-06 16:44:46,226 INFO L853 garLoopResultBuilder]: At program point L5765-5(lines 5757 5767) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1)) [2021-11-06 16:44:46,226 INFO L857 garLoopResultBuilder]: For program point L6195(line 6195) no Hoare annotation was computed. [2021-11-06 16:44:46,226 INFO L853 garLoopResultBuilder]: At program point L6922(lines 1 7033) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2021-11-06 16:44:46,226 INFO L853 garLoopResultBuilder]: At program point L6988(lines 6987 6989) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1)) [2021-11-06 16:44:46,227 INFO L857 garLoopResultBuilder]: For program point L6856-1(lines 6856 6859) no Hoare annotation was computed. [2021-11-06 16:44:46,227 INFO L857 garLoopResultBuilder]: For program point L6856(lines 6856 6859) no Hoare annotation was computed. [2021-11-06 16:44:46,227 INFO L857 garLoopResultBuilder]: For program point L6130(lines 6130 6161) no Hoare annotation was computed. [2021-11-06 16:44:46,227 INFO L857 garLoopResultBuilder]: For program point L6031(lines 6031 6041) no Hoare annotation was computed. [2021-11-06 16:44:46,227 INFO L857 garLoopResultBuilder]: For program point L6064(line 6064) no Hoare annotation was computed. [2021-11-06 16:44:46,227 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-06 16:44:46,228 INFO L853 garLoopResultBuilder]: At program point L6296(lines 6291 6298) the Hoare annotation is: (let ((.cse0 (= 1 ~ldv_mutex_mutex_of_device~0)) (.cse1 (= ~ldv_mutex_i_mutex_of_inode~0 1)) (.cse2 (= ~ldv_mutex_lock~0 1))) (or (and .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res| 1) 0) (<= (+ |ULTIMATE.start_ldv_undef_int_negative_#res| 1) 0) (<= (+ ULTIMATE.start_ldv_undef_int_negative_~ret~0 1) 0) (<= (+ |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res| 1) 0) (= ~ldv_mutex_udev~0 1)) (and .cse0 .cse1 .cse2 (= 2 ~ldv_mutex_udev~0) (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res| 0) (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res| 0)))) [2021-11-06 16:44:46,228 INFO L857 garLoopResultBuilder]: For program point L6131(line 6131) no Hoare annotation was computed. [2021-11-06 16:44:46,229 INFO L857 garLoopResultBuilder]: For program point L6065(lines 6065 6125) no Hoare annotation was computed. [2021-11-06 16:44:46,229 INFO L857 garLoopResultBuilder]: For program point L6032(line 6032) no Hoare annotation was computed. [2021-11-06 16:44:46,229 INFO L857 garLoopResultBuilder]: For program point L6132(lines 6132 6137) no Hoare annotation was computed. [2021-11-06 16:44:46,229 INFO L857 garLoopResultBuilder]: For program point L6033(lines 6033 6037) no Hoare annotation was computed. [2021-11-06 16:44:46,229 INFO L853 garLoopResultBuilder]: At program point L7024(lines 7023 7025) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2021-11-06 16:44:46,229 INFO L857 garLoopResultBuilder]: For program point L6166(line 6166) no Hoare annotation was computed. [2021-11-06 16:44:46,229 INFO L857 garLoopResultBuilder]: For program point L6067(lines 6067 6122) no Hoare annotation was computed. [2021-11-06 16:44:46,230 INFO L857 garLoopResultBuilder]: For program point L6100(line 6100) no Hoare annotation was computed. [2021-11-06 16:44:46,231 INFO L853 garLoopResultBuilder]: At program point L6992(lines 6991 6993) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2021-11-06 16:44:46,231 INFO L857 garLoopResultBuilder]: For program point L6332-2(line 6332) no Hoare annotation was computed. [2021-11-06 16:44:46,231 INFO L857 garLoopResultBuilder]: For program point L6332-1(line 6332) no Hoare annotation was computed. [2021-11-06 16:44:46,231 INFO L857 garLoopResultBuilder]: For program point L6332(line 6332) no Hoare annotation was computed. [2021-11-06 16:44:46,231 INFO L857 garLoopResultBuilder]: For program point L6167(lines 6167 6182) no Hoare annotation was computed. [2021-11-06 16:44:46,232 INFO L857 garLoopResultBuilder]: For program point L6332-5(line 6332) no Hoare annotation was computed. [2021-11-06 16:44:46,232 INFO L857 garLoopResultBuilder]: For program point L6332-4(line 6332) no Hoare annotation was computed. [2021-11-06 16:44:46,232 INFO L857 garLoopResultBuilder]: For program point L6332-3(line 6332) no Hoare annotation was computed. [2021-11-06 16:44:46,232 INFO L857 garLoopResultBuilder]: For program point L6101(lines 6101 6108) no Hoare annotation was computed. [2021-11-06 16:44:46,232 INFO L857 garLoopResultBuilder]: For program point L6068(line 6068) no Hoare annotation was computed. [2021-11-06 16:44:46,232 INFO L853 garLoopResultBuilder]: At program point L6861(lines 6853 6863) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= 2 ~ldv_mutex_udev~0)) [2021-11-06 16:44:46,232 INFO L857 garLoopResultBuilder]: For program point L6069(lines 6069 6077) no Hoare annotation was computed. [2021-11-06 16:44:46,233 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-06 16:44:46,233 INFO L857 garLoopResultBuilder]: For program point L6202(line 6202) no Hoare annotation was computed. [2021-11-06 16:44:46,233 INFO L857 garLoopResultBuilder]: For program point L6103(lines 6103 6106) no Hoare annotation was computed. [2021-11-06 16:44:46,233 INFO L857 garLoopResultBuilder]: For program point L6169(lines 6169 6179) no Hoare annotation was computed. [2021-11-06 16:44:46,233 INFO L853 garLoopResultBuilder]: At program point L7028(lines 7027 7029) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2021-11-06 16:44:46,233 INFO L853 garLoopResultBuilder]: At program point L5773(lines 5768 5775) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1)) [2021-11-06 16:44:46,233 INFO L857 garLoopResultBuilder]: For program point L6203(lines 6203 6218) no Hoare annotation was computed. [2021-11-06 16:44:46,233 INFO L857 garLoopResultBuilder]: For program point L6170(line 6170) no Hoare annotation was computed. [2021-11-06 16:44:46,234 INFO L857 garLoopResultBuilder]: For program point L6071(lines 6071 6075) no Hoare annotation was computed. [2021-11-06 16:44:46,234 INFO L853 garLoopResultBuilder]: At program point L5840-1(lines 5837 5842) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2021-11-06 16:44:46,234 INFO L853 garLoopResultBuilder]: At program point L5840-2(lines 5837 5842) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2021-11-06 16:44:46,234 INFO L853 garLoopResultBuilder]: At program point L5840(lines 5837 5842) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2021-11-06 16:44:46,234 INFO L853 garLoopResultBuilder]: At program point L5840-3(lines 5837 5842) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2021-11-06 16:44:46,234 INFO L857 garLoopResultBuilder]: For program point L6171(lines 6171 6175) no Hoare annotation was computed. [2021-11-06 16:44:46,235 INFO L857 garLoopResultBuilder]: For program point L6039(line 6039) no Hoare annotation was computed. [2021-11-06 16:44:46,235 INFO L857 garLoopResultBuilder]: For program point L6139(line 6139) no Hoare annotation was computed. [2021-11-06 16:44:46,235 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-06 16:44:46,235 INFO L857 garLoopResultBuilder]: For program point L6205(lines 6205 6215) no Hoare annotation was computed. [2021-11-06 16:44:46,235 INFO L857 garLoopResultBuilder]: For program point L6965(lines 6964 6982) no Hoare annotation was computed. [2021-11-06 16:44:46,235 INFO L857 garLoopResultBuilder]: For program point L6206(line 6206) no Hoare annotation was computed. [2021-11-06 16:44:46,235 INFO L857 garLoopResultBuilder]: For program point L6140(lines 6140 6157) no Hoare annotation was computed. [2021-11-06 16:44:46,235 INFO L857 garLoopResultBuilder]: For program point L6207(lines 6207 6211) no Hoare annotation was computed. [2021-11-06 16:44:46,236 INFO L853 garLoopResultBuilder]: At program point L5976(lines 5970 5978) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2021-11-06 16:44:46,236 INFO L857 garLoopResultBuilder]: For program point L6142(lines 6142 6150) no Hoare annotation was computed. [2021-11-06 16:44:46,236 INFO L857 garLoopResultBuilder]: For program point L6142-2(lines 6140 6156) no Hoare annotation was computed. [2021-11-06 16:44:46,236 INFO L857 garLoopResultBuilder]: For program point L6110(line 6110) no Hoare annotation was computed. [2021-11-06 16:44:46,236 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-06 16:44:46,236 INFO L857 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2021-11-06 16:44:46,236 INFO L857 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2021-11-06 16:44:46,236 INFO L857 garLoopResultBuilder]: For program point L-1-3(line -1) no Hoare annotation was computed. [2021-11-06 16:44:46,237 INFO L857 garLoopResultBuilder]: For program point L-1-4(line -1) no Hoare annotation was computed. [2021-11-06 16:44:46,237 INFO L857 garLoopResultBuilder]: For program point L-1-5(line -1) no Hoare annotation was computed. [2021-11-06 16:44:46,237 INFO L857 garLoopResultBuilder]: For program point L-1-6(line -1) no Hoare annotation was computed. [2021-11-06 16:44:46,237 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6333) no Hoare annotation was computed. [2021-11-06 16:44:46,237 INFO L853 garLoopResultBuilder]: At program point L-1-8(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1)) [2021-11-06 16:44:46,237 INFO L857 garLoopResultBuilder]: For program point L-1-9(line -1) no Hoare annotation was computed. [2021-11-06 16:44:46,237 INFO L857 garLoopResultBuilder]: For program point L6969(lines 6964 6982) no Hoare annotation was computed. [2021-11-06 16:44:46,238 INFO L857 garLoopResultBuilder]: For program point L-1-10(line -1) no Hoare annotation was computed. [2021-11-06 16:44:46,238 INFO L857 garLoopResultBuilder]: For program point L6111(lines 6111 6118) no Hoare annotation was computed. [2021-11-06 16:44:46,238 INFO L857 garLoopResultBuilder]: For program point L6177(line 6177) no Hoare annotation was computed. [2021-11-06 16:44:46,238 INFO L853 garLoopResultBuilder]: At program point L5781(lines 5776 5783) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2021-11-06 16:44:46,238 INFO L853 garLoopResultBuilder]: At program point L5781-1(lines 5776 5783) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2021-11-06 16:44:46,238 INFO L857 garLoopResultBuilder]: For program point L6343-1(lines 6343 6346) no Hoare annotation was computed. [2021-11-06 16:44:46,238 INFO L857 garLoopResultBuilder]: For program point L6343(lines 6343 6346) no Hoare annotation was computed. [2021-11-06 16:44:46,239 INFO L857 garLoopResultBuilder]: For program point L6079(line 6079) no Hoare annotation was computed. [2021-11-06 16:44:46,239 INFO L857 garLoopResultBuilder]: For program point L6046(line 6046) no Hoare annotation was computed. [2021-11-06 16:44:46,241 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 16:44:46,242 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-06 16:44:46,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 04:44:46 BoogieIcfgContainer [2021-11-06 16:44:46,278 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-06 16:44:46,279 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-06 16:44:46,279 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-06 16:44:46,279 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-06 16:44:46,279 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 04:44:43" (3/4) ... [2021-11-06 16:44:46,281 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-06 16:44:46,300 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 59 nodes and edges [2021-11-06 16:44:46,301 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2021-11-06 16:44:46,302 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-06 16:44:46,303 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-06 16:44:46,304 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-06 16:44:46,332 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && \result + 1 <= 0) && \result + 1 <= 0) && ret + 1 <= 0) && ldv_mutex_udev == 1) || ((((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && 2 == ldv_mutex_udev) && \result == 0) [2021-11-06 16:44:46,333 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && \result + 1 <= 0) && \result + 1 <= 0) && ret + 1 <= 0) && \result + 1 <= 0) && ldv_mutex_udev == 1) || (((((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && 2 == ldv_mutex_udev) && \result == 0) && \result == 0) [2021-11-06 16:44:46,334 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && \result + 1 <= 0) && ret + 1 <= 0) && ldv_mutex_udev == 1 [2021-11-06 16:44:46,334 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && r == 0) && ldv_mutex_lock == 1) && 2 == ldv_mutex_udev) && \result == 0) && \result == 0 [2021-11-06 16:44:46,334 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && r == 0) && ldv_mutex_lock == 1) && 2 == ldv_mutex_udev) && \result == 0) && \result == 0 [2021-11-06 16:44:46,499 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-06 16:44:46,499 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-06 16:44:46,501 INFO L168 Benchmark]: Toolchain (without parser) took 5100.94 ms. Allocated memory was 86.0 MB in the beginning and 316.7 MB in the end (delta: 230.7 MB). Free memory was 45.2 MB in the beginning and 221.5 MB in the end (delta: -176.3 MB). Peak memory consumption was 201.1 MB. Max. memory is 16.1 GB. [2021-11-06 16:44:46,501 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 86.0 MB. Free memory was 57.6 MB in the beginning and 57.5 MB in the end (delta: 29.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-06 16:44:46,501 INFO L168 Benchmark]: CACSL2BoogieTranslator took 929.15 ms. Allocated memory was 86.0 MB in the beginning and 119.5 MB in the end (delta: 33.6 MB). Free memory was 45.1 MB in the beginning and 61.8 MB in the end (delta: -16.7 MB). Peak memory consumption was 37.9 MB. Max. memory is 16.1 GB. [2021-11-06 16:44:46,501 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.22 ms. Allocated memory is still 119.5 MB. Free memory was 61.8 MB in the beginning and 52.7 MB in the end (delta: 9.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-06 16:44:46,501 INFO L168 Benchmark]: Boogie Preprocessor took 79.91 ms. Allocated memory was 119.5 MB in the beginning and 180.4 MB in the end (delta: 60.8 MB). Free memory was 52.7 MB in the beginning and 127.6 MB in the end (delta: -74.9 MB). Peak memory consumption was 14.2 MB. Max. memory is 16.1 GB. [2021-11-06 16:44:46,502 INFO L168 Benchmark]: RCFGBuilder took 1183.91 ms. Allocated memory is still 180.4 MB. Free memory was 127.6 MB in the beginning and 121.2 MB in the end (delta: 6.4 MB). Peak memory consumption was 60.7 MB. Max. memory is 16.1 GB. [2021-11-06 16:44:46,502 INFO L168 Benchmark]: TraceAbstraction took 2578.44 ms. Allocated memory was 180.4 MB in the beginning and 316.7 MB in the end (delta: 136.3 MB). Free memory was 121.2 MB in the beginning and 198.5 MB in the end (delta: -77.3 MB). Peak memory consumption was 135.1 MB. Max. memory is 16.1 GB. [2021-11-06 16:44:46,502 INFO L168 Benchmark]: Witness Printer took 220.81 ms. Allocated memory is still 316.7 MB. Free memory was 198.5 MB in the beginning and 221.5 MB in the end (delta: -23.0 MB). Peak memory consumption was 120.7 MB. Max. memory is 16.1 GB. [2021-11-06 16:44:46,503 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 86.0 MB. Free memory was 57.6 MB in the beginning and 57.5 MB in the end (delta: 29.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 929.15 ms. Allocated memory was 86.0 MB in the beginning and 119.5 MB in the end (delta: 33.6 MB). Free memory was 45.1 MB in the beginning and 61.8 MB in the end (delta: -16.7 MB). Peak memory consumption was 37.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 102.22 ms. Allocated memory is still 119.5 MB. Free memory was 61.8 MB in the beginning and 52.7 MB in the end (delta: 9.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 79.91 ms. Allocated memory was 119.5 MB in the beginning and 180.4 MB in the end (delta: 60.8 MB). Free memory was 52.7 MB in the beginning and 127.6 MB in the end (delta: -74.9 MB). Peak memory consumption was 14.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1183.91 ms. Allocated memory is still 180.4 MB. Free memory was 127.6 MB in the beginning and 121.2 MB in the end (delta: 6.4 MB). Peak memory consumption was 60.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 2578.44 ms. Allocated memory was 180.4 MB in the beginning and 316.7 MB in the end (delta: 136.3 MB). Free memory was 121.2 MB in the beginning and 198.5 MB in the end (delta: -77.3 MB). Peak memory consumption was 135.1 MB. Max. memory is 16.1 GB. * Witness Printer took 220.81 ms. Allocated memory is still 316.7 MB. Free memory was 198.5 MB in the beginning and 221.5 MB in the end (delta: -23.0 MB). Peak memory consumption was 120.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 6333]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 6333]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 6333]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 6333]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 6333]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 6333]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 157 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 2417 SDtfs, 2528 SDslu, 2902 SDs, 0 SdLazy, 88 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=679occurred in iteration=7, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 1235 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 48 LocationsWithAnnotation, 48 PreInvPairs, 203 NumberOfFragments, 634 HoareAnnotationTreeSize, 48 FomulaSimplifications, 10313 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 48 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 535 NumberOfCodeBlocks, 535 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 525 ConstructedInterpolants, 0 QuantifiedInterpolants, 991 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 16/16 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 7008]: Loop Invariant Derived loop invariant: (((ldv_state_variable_0 == 1 && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 7019]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 7027]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 5794]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5970]: Loop Invariant Derived loop invariant: (((ldv_state_variable_0 == 1 && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 5757]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_state_variable_6 == 0) && ldv_mutex_udev == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 5794]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6987]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_state_variable_6 == 0) && ldv_mutex_udev == 1 - InvariantResult [Line: 5837]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 5776]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 6965]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 5979]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5837]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 7015]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 5757]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_state_variable_6 == 0) && ldv_mutex_udev == 1 - InvariantResult [Line: 6336]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && \result + 1 <= 0) && ret + 1 <= 0) && ldv_mutex_udev == 1 - InvariantResult [Line: 6853]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && 2 == ldv_mutex_udev - InvariantResult [Line: 6940]: Loop Invariant Derived loop invariant: ((((((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && \result + 1 <= 0) && \result + 1 <= 0) && ret + 1 <= 0) && ldv_mutex_udev == 1) || ((((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && 2 == ldv_mutex_udev) && \result == 0) - InvariantResult [Line: 6984]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && r == 0) && ldv_mutex_lock == 1) && 2 == ldv_mutex_udev) && \result == 0) && \result == 0 - InvariantResult [Line: 5794]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7023]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 7004]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 6002]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 5757]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_state_variable_6 == 0) && ldv_mutex_udev == 1 - InvariantResult [Line: 5757]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_state_variable_6 == 0) && ldv_mutex_udev == 1 - InvariantResult [Line: 5768]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_state_variable_6 == 0) && ldv_mutex_udev == 1 - InvariantResult [Line: 5837]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 5794]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6962]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5794]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6307]: Loop Invariant Derived loop invariant: (((ldv_state_variable_0 == 1 && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 5794]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5757]: Loop Invariant Derived loop invariant: (((ldv_state_variable_0 == 1 && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 5757]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_state_variable_6 == 0) && ldv_mutex_udev == 1 - InvariantResult [Line: 5837]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 6291]: Loop Invariant Derived loop invariant: (((((((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && \result + 1 <= 0) && \result + 1 <= 0) && ret + 1 <= 0) && \result + 1 <= 0) && ldv_mutex_udev == 1) || (((((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && 2 == ldv_mutex_udev) && \result == 0) && \result == 0) - InvariantResult [Line: 5794]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_state_variable_6 == 0) && ldv_mutex_udev == 1 - InvariantResult [Line: 7015]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 5794]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6991]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 7012]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && r == 0) && ldv_mutex_lock == 1) && 2 == ldv_mutex_udev) && \result == 0) && \result == 0 - InvariantResult [Line: 5757]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_state_variable_6 == 0) && ldv_mutex_udev == 1 - InvariantResult [Line: 5776]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 5794]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5948]: Loop Invariant Derived loop invariant: (((ldv_state_variable_0 == 1 && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 RESULT: Ultimate proved your program to be correct! [2021-11-06 16:44:46,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE