./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 4edb193076708f948a5a928b73ff1ed0e628ab63 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 01:35:21,982 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 01:35:21,985 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 01:35:21,998 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 01:35:21,999 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 01:35:22,000 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 01:35:22,002 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 01:35:22,004 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 01:35:22,006 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 01:35:22,007 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 01:35:22,008 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 01:35:22,009 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 01:35:22,010 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 01:35:22,011 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 01:35:22,012 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 01:35:22,013 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 01:35:22,014 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 01:35:22,015 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 01:35:22,017 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 01:35:22,019 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 01:35:22,021 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 01:35:22,022 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 01:35:22,024 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 01:35:22,025 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 01:35:22,027 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 01:35:22,028 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 01:35:22,028 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 01:35:22,029 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 01:35:22,030 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 01:35:22,031 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 01:35:22,031 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 01:35:22,032 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 01:35:22,033 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 01:35:22,034 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 01:35:22,035 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 01:35:22,035 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 01:35:22,036 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 01:35:22,036 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 01:35:22,036 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 01:35:22,038 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 01:35:22,038 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 01:35:22,039 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2019-11-28 01:35:22,054 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 01:35:22,055 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 01:35:22,056 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 01:35:22,056 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 01:35:22,057 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 01:35:22,057 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 01:35:22,057 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 01:35:22,058 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 01:35:22,058 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 01:35:22,058 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 01:35:22,058 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 01:35:22,059 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 01:35:22,059 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 01:35:22,059 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 01:35:22,060 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 01:35:22,060 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 01:35:22,060 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 01:35:22,061 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 01:35:22,061 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 01:35:22,061 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 01:35:22,061 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 01:35:22,062 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 01:35:22,062 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 01:35:22,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 01:35:22,062 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 01:35:22,063 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-28 01:35:22,063 INFO L138 SettingsManager]: * To the following directory=dump/ Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4edb193076708f948a5a928b73ff1ed0e628ab63 [2019-11-28 01:35:22,395 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 01:35:22,415 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 01:35:22,420 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 01:35:22,422 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 01:35:22,424 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 01:35:22,425 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2019-11-28 01:35:22,501 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e28d856f/2121940174c441ab8b3ad6a1951b1db9/FLAGa428bfeb2 [2019-11-28 01:35:23,260 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 01:35:23,261 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2019-11-28 01:35:23,287 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e28d856f/2121940174c441ab8b3ad6a1951b1db9/FLAGa428bfeb2 [2019-11-28 01:35:23,307 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e28d856f/2121940174c441ab8b3ad6a1951b1db9 [2019-11-28 01:35:23,311 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 01:35:23,313 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 01:35:23,314 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 01:35:23,314 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 01:35:23,318 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 01:35:23,319 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:35:23" (1/1) ... [2019-11-28 01:35:23,323 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f7322c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:23, skipping insertion in model container [2019-11-28 01:35:23,323 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:35:23" (1/1) ... [2019-11-28 01:35:23,331 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 01:35:23,399 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 01:35:24,321 WARN L612 FunctionHandler]: implicit declaration of function ldv_malloc [2019-11-28 01:35:24,334 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 01:35:24,362 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 01:35:24,474 WARN L612 FunctionHandler]: implicit declaration of function ldv_malloc [2019-11-28 01:35:24,479 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 01:35:24,559 INFO L208 MainTranslator]: Completed translation [2019-11-28 01:35:24,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:24 WrapperNode [2019-11-28 01:35:24,560 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 01:35:24,560 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 01:35:24,561 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 01:35:24,561 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 01:35:24,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:24" (1/1) ... [2019-11-28 01:35:24,601 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:24" (1/1) ... [2019-11-28 01:35:24,663 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 01:35:24,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 01:35:24,664 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 01:35:24,664 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 01:35:24,675 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:24" (1/1) ... [2019-11-28 01:35:24,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:24" (1/1) ... [2019-11-28 01:35:24,687 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:24" (1/1) ... [2019-11-28 01:35:24,687 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:24" (1/1) ... [2019-11-28 01:35:24,717 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:24" (1/1) ... [2019-11-28 01:35:24,723 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:24" (1/1) ... [2019-11-28 01:35:24,731 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:24" (1/1) ... [2019-11-28 01:35:24,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 01:35:24,740 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 01:35:24,741 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 01:35:24,741 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 01:35:24,742 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 01:35:24,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 01:35:24,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 01:35:24,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 01:35:24,830 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-28 01:35:24,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 01:35:24,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-28 01:35:24,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 01:35:24,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 01:35:24,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 01:35:24,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 01:35:26,172 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 01:35:26,173 INFO L297 CfgBuilder]: Removed 108 assume(true) statements. [2019-11-28 01:35:26,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:35:26 BoogieIcfgContainer [2019-11-28 01:35:26,175 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 01:35:26,176 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 01:35:26,176 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 01:35:26,180 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 01:35:26,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 01:35:23" (1/3) ... [2019-11-28 01:35:26,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2705add9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:35:26, skipping insertion in model container [2019-11-28 01:35:26,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:24" (2/3) ... [2019-11-28 01:35:26,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2705add9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:35:26, skipping insertion in model container [2019-11-28 01:35:26,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:35:26" (3/3) ... [2019-11-28 01:35:26,184 INFO L109 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2019-11-28 01:35:26,196 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 01:35:26,205 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-11-28 01:35:26,219 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-11-28 01:35:26,249 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 01:35:26,249 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 01:35:26,249 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 01:35:26,249 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 01:35:26,250 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 01:35:26,250 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 01:35:26,250 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 01:35:26,250 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 01:35:26,274 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2019-11-28 01:35:26,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 01:35:26,283 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 01:35:26,284 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 01:35:26,284 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 01:35:26,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 01:35:26,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1593182064, now seen corresponding path program 1 times [2019-11-28 01:35:26,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 01:35:26,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581767542] [2019-11-28 01:35:26,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 01:35:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 01:35:26,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 01:35:26,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581767542] [2019-11-28 01:35:26,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 01:35:26,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 01:35:26,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582508176] [2019-11-28 01:35:26,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 01:35:26,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 01:35:26,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 01:35:26,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 01:35:26,780 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 3 states. [2019-11-28 01:35:26,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 01:35:26,906 INFO L93 Difference]: Finished difference Result 367 states and 513 transitions. [2019-11-28 01:35:26,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 01:35:26,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-28 01:35:26,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 01:35:26,926 INFO L225 Difference]: With dead ends: 367 [2019-11-28 01:35:26,926 INFO L226 Difference]: Without dead ends: 235 [2019-11-28 01:35:26,931 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 01:35:26,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-11-28 01:35:26,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 227. [2019-11-28 01:35:26,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-11-28 01:35:26,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 312 transitions. [2019-11-28 01:35:27,000 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 312 transitions. Word has length 12 [2019-11-28 01:35:27,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 01:35:27,001 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 312 transitions. [2019-11-28 01:35:27,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 01:35:27,001 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 312 transitions. [2019-11-28 01:35:27,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 01:35:27,003 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 01:35:27,003 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 01:35:27,004 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 01:35:27,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 01:35:27,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1164974207, now seen corresponding path program 1 times [2019-11-28 01:35:27,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 01:35:27,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155212892] [2019-11-28 01:35:27,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 01:35:27,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 01:35:27,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 01:35:27,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155212892] [2019-11-28 01:35:27,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 01:35:27,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 01:35:27,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432704497] [2019-11-28 01:35:27,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 01:35:27,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 01:35:27,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 01:35:27,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 01:35:27,198 INFO L87 Difference]: Start difference. First operand 227 states and 312 transitions. Second operand 3 states. [2019-11-28 01:35:27,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 01:35:27,294 INFO L93 Difference]: Finished difference Result 590 states and 818 transitions. [2019-11-28 01:35:27,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 01:35:27,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-28 01:35:27,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 01:35:27,299 INFO L225 Difference]: With dead ends: 590 [2019-11-28 01:35:27,299 INFO L226 Difference]: Without dead ends: 366 [2019-11-28 01:35:27,302 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 01:35:27,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-11-28 01:35:27,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 353. [2019-11-28 01:35:27,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-11-28 01:35:27,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 495 transitions. [2019-11-28 01:35:27,357 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 495 transitions. Word has length 15 [2019-11-28 01:35:27,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 01:35:27,358 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 495 transitions. [2019-11-28 01:35:27,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 01:35:27,358 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 495 transitions. [2019-11-28 01:35:27,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 01:35:27,363 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 01:35:27,363 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 01:35:27,364 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 01:35:27,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 01:35:27,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1419956254, now seen corresponding path program 1 times [2019-11-28 01:35:27,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 01:35:27,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089584088] [2019-11-28 01:35:27,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 01:35:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 01:35:27,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 01:35:27,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089584088] [2019-11-28 01:35:27,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 01:35:27,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 01:35:27,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055913802] [2019-11-28 01:35:27,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 01:35:27,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 01:35:27,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 01:35:27,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 01:35:27,485 INFO L87 Difference]: Start difference. First operand 353 states and 495 transitions. Second operand 3 states. [2019-11-28 01:35:27,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 01:35:27,545 INFO L93 Difference]: Finished difference Result 377 states and 517 transitions. [2019-11-28 01:35:27,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 01:35:27,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 01:35:27,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 01:35:27,551 INFO L225 Difference]: With dead ends: 377 [2019-11-28 01:35:27,552 INFO L226 Difference]: Without dead ends: 365 [2019-11-28 01:35:27,553 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 01:35:27,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-11-28 01:35:27,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 353. [2019-11-28 01:35:27,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-11-28 01:35:27,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 494 transitions. [2019-11-28 01:35:27,606 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 494 transitions. Word has length 16 [2019-11-28 01:35:27,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 01:35:27,606 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 494 transitions. [2019-11-28 01:35:27,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 01:35:27,607 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 494 transitions. [2019-11-28 01:35:27,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 01:35:27,613 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 01:35:27,614 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 01:35:27,614 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 01:35:27,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 01:35:27,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1419896672, now seen corresponding path program 1 times [2019-11-28 01:35:27,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 01:35:27,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126111929] [2019-11-28 01:35:27,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 01:35:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 01:35:27,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 01:35:27,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126111929] [2019-11-28 01:35:27,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 01:35:27,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 01:35:27,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220076303] [2019-11-28 01:35:27,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 01:35:27,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 01:35:27,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 01:35:27,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 01:35:27,740 INFO L87 Difference]: Start difference. First operand 353 states and 494 transitions. Second operand 3 states. [2019-11-28 01:35:27,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 01:35:27,781 INFO L93 Difference]: Finished difference Result 353 states and 494 transitions. [2019-11-28 01:35:27,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 01:35:27,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 01:35:27,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 01:35:27,784 INFO L225 Difference]: With dead ends: 353 [2019-11-28 01:35:27,785 INFO L226 Difference]: Without dead ends: 351 [2019-11-28 01:35:27,786 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 01:35:27,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-11-28 01:35:27,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2019-11-28 01:35:27,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-11-28 01:35:27,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 492 transitions. [2019-11-28 01:35:27,802 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 492 transitions. Word has length 16 [2019-11-28 01:35:27,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 01:35:27,803 INFO L462 AbstractCegarLoop]: Abstraction has 351 states and 492 transitions. [2019-11-28 01:35:27,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 01:35:27,804 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 492 transitions. [2019-11-28 01:35:27,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 01:35:27,805 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 01:35:27,805 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 01:35:27,805 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 01:35:27,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 01:35:27,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1067125132, now seen corresponding path program 1 times [2019-11-28 01:35:27,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 01:35:27,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456754639] [2019-11-28 01:35:27,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 01:35:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 01:35:27,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 01:35:27,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456754639] [2019-11-28 01:35:27,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 01:35:27,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 01:35:27,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598008994] [2019-11-28 01:35:27,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 01:35:27,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 01:35:27,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 01:35:27,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 01:35:27,880 INFO L87 Difference]: Start difference. First operand 351 states and 492 transitions. Second operand 3 states. [2019-11-28 01:35:27,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 01:35:27,926 INFO L93 Difference]: Finished difference Result 351 states and 492 transitions. [2019-11-28 01:35:27,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 01:35:27,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 01:35:27,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 01:35:27,929 INFO L225 Difference]: With dead ends: 351 [2019-11-28 01:35:27,930 INFO L226 Difference]: Without dead ends: 349 [2019-11-28 01:35:27,930 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 01:35:27,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-11-28 01:35:27,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2019-11-28 01:35:27,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-11-28 01:35:27,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 490 transitions. [2019-11-28 01:35:27,951 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 490 transitions. Word has length 17 [2019-11-28 01:35:27,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 01:35:27,951 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 490 transitions. [2019-11-28 01:35:27,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 01:35:27,952 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 490 transitions. [2019-11-28 01:35:27,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 01:35:27,953 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 01:35:27,953 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 01:35:27,954 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 01:35:27,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 01:35:27,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1278858026, now seen corresponding path program 1 times [2019-11-28 01:35:27,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 01:35:27,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859336950] [2019-11-28 01:35:27,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 01:35:27,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 01:35:28,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 01:35:28,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859336950] [2019-11-28 01:35:28,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 01:35:28,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 01:35:28,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577227217] [2019-11-28 01:35:28,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 01:35:28,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 01:35:28,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 01:35:28,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 01:35:28,042 INFO L87 Difference]: Start difference. First operand 349 states and 490 transitions. Second operand 3 states. [2019-11-28 01:35:28,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 01:35:28,112 INFO L93 Difference]: Finished difference Result 349 states and 490 transitions. [2019-11-28 01:35:28,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 01:35:28,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 01:35:28,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 01:35:28,115 INFO L225 Difference]: With dead ends: 349 [2019-11-28 01:35:28,115 INFO L226 Difference]: Without dead ends: 343 [2019-11-28 01:35:28,116 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 01:35:28,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-11-28 01:35:28,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2019-11-28 01:35:28,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-11-28 01:35:28,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 482 transitions. [2019-11-28 01:35:28,136 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 482 transitions. Word has length 18 [2019-11-28 01:35:28,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 01:35:28,136 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 482 transitions. [2019-11-28 01:35:28,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 01:35:28,137 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 482 transitions. [2019-11-28 01:35:28,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 01:35:28,137 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 01:35:28,137 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 01:35:28,138 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 01:35:28,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 01:35:28,138 INFO L82 PathProgramCache]: Analyzing trace with hash 989891902, now seen corresponding path program 1 times [2019-11-28 01:35:28,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 01:35:28,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89071252] [2019-11-28 01:35:28,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 01:35:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 01:35:28,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 01:35:28,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89071252] [2019-11-28 01:35:28,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 01:35:28,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 01:35:28,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49912277] [2019-11-28 01:35:28,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 01:35:28,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 01:35:28,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 01:35:28,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 01:35:28,306 INFO L87 Difference]: Start difference. First operand 343 states and 482 transitions. Second operand 3 states. [2019-11-28 01:35:28,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 01:35:28,345 INFO L93 Difference]: Finished difference Result 343 states and 482 transitions. [2019-11-28 01:35:28,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 01:35:28,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 01:35:28,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 01:35:28,349 INFO L225 Difference]: With dead ends: 343 [2019-11-28 01:35:28,350 INFO L226 Difference]: Without dead ends: 336 [2019-11-28 01:35:28,350 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 01:35:28,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-11-28 01:35:28,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2019-11-28 01:35:28,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-11-28 01:35:28,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 472 transitions. [2019-11-28 01:35:28,370 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 472 transitions. Word has length 19 [2019-11-28 01:35:28,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 01:35:28,370 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 472 transitions. [2019-11-28 01:35:28,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 01:35:28,370 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 472 transitions. [2019-11-28 01:35:28,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 01:35:28,372 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 01:35:28,372 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 01:35:28,372 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 01:35:28,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 01:35:28,373 INFO L82 PathProgramCache]: Analyzing trace with hash 2046732670, now seen corresponding path program 1 times [2019-11-28 01:35:28,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 01:35:28,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334388639] [2019-11-28 01:35:28,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 01:35:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 01:35:28,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 01:35:28,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334388639] [2019-11-28 01:35:28,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 01:35:28,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 01:35:28,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130972658] [2019-11-28 01:35:28,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 01:35:28,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 01:35:28,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 01:35:28,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 01:35:28,446 INFO L87 Difference]: Start difference. First operand 336 states and 472 transitions. Second operand 3 states. [2019-11-28 01:35:28,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 01:35:28,504 INFO L93 Difference]: Finished difference Result 336 states and 472 transitions. [2019-11-28 01:35:28,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 01:35:28,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-28 01:35:28,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 01:35:28,505 INFO L225 Difference]: With dead ends: 336 [2019-11-28 01:35:28,505 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 01:35:28,507 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 01:35:28,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 01:35:28,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 01:35:28,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 01:35:28,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 01:35:28,508 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2019-11-28 01:35:28,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 01:35:28,510 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 01:35:28,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 01:35:28,510 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 01:35:28,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 01:35:28,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 01:35:29,209 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 2676) no Hoare annotation was computed. [2019-11-28 01:35:29,209 INFO L246 CegarLoopResult]: For program point L2480(line 2480) no Hoare annotation was computed. [2019-11-28 01:35:29,210 INFO L246 CegarLoopResult]: For program point L2513(line 2513) no Hoare annotation was computed. [2019-11-28 01:35:29,210 INFO L246 CegarLoopResult]: For program point L2447(lines 2447 2474) no Hoare annotation was computed. [2019-11-28 01:35:29,210 INFO L242 CegarLoopResult]: At program point L2381(lines 2371 2387) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,210 INFO L242 CegarLoopResult]: At program point L3174(lines 1 3196) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,210 INFO L242 CegarLoopResult]: At program point L3174-1(lines 1 3196) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,211 INFO L246 CegarLoopResult]: For program point L2514(lines 2514 2550) no Hoare annotation was computed. [2019-11-28 01:35:29,211 INFO L246 CegarLoopResult]: For program point L2481(lines 2481 2486) no Hoare annotation was computed. [2019-11-28 01:35:29,211 INFO L246 CegarLoopResult]: For program point L2316(lines 2316 2319) no Hoare annotation was computed. [2019-11-28 01:35:29,212 INFO L246 CegarLoopResult]: For program point L2250(lines 2250 2253) no Hoare annotation was computed. [2019-11-28 01:35:29,212 INFO L246 CegarLoopResult]: For program point L2250-2(lines 2250 2253) no Hoare annotation was computed. [2019-11-28 01:35:29,212 INFO L242 CegarLoopResult]: At program point L3142(lines 3141 3143) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,212 INFO L242 CegarLoopResult]: At program point L3109(lines 3102 3111) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= ~ldv_state_variable_3~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,213 INFO L246 CegarLoopResult]: For program point L2449(lines 2449 2471) no Hoare annotation was computed. [2019-11-28 01:35:29,213 INFO L242 CegarLoopResult]: At program point L2383(lines 2371 2387) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,213 INFO L246 CegarLoopResult]: For program point L2516(lines 2516 2547) no Hoare annotation was computed. [2019-11-28 01:35:29,213 INFO L246 CegarLoopResult]: For program point L2450(line 2450) no Hoare annotation was computed. [2019-11-28 01:35:29,213 INFO L242 CegarLoopResult]: At program point L3177-1(lines 3176 3178) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,214 INFO L242 CegarLoopResult]: At program point L3177(lines 3176 3178) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,214 INFO L246 CegarLoopResult]: For program point L2517(line 2517) no Hoare annotation was computed. [2019-11-28 01:35:29,214 INFO L246 CegarLoopResult]: For program point L2451(lines 2451 2459) no Hoare annotation was computed. [2019-11-28 01:35:29,214 INFO L242 CegarLoopResult]: At program point L2683(lines 2680 2685) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,215 INFO L246 CegarLoopResult]: For program point L2518(lines 2518 2522) no Hoare annotation was computed. [2019-11-28 01:35:29,215 INFO L242 CegarLoopResult]: At program point L2386(lines 2367 2388) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,215 INFO L242 CegarLoopResult]: At program point L3146(lines 3145 3147) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,215 INFO L246 CegarLoopResult]: For program point L2552(line 2552) no Hoare annotation was computed. [2019-11-28 01:35:29,215 INFO L246 CegarLoopResult]: For program point L2453(lines 2453 2457) no Hoare annotation was computed. [2019-11-28 01:35:29,216 INFO L242 CegarLoopResult]: At program point L2222(lines 2218 2224) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,216 INFO L242 CegarLoopResult]: At program point L2255(lines 2241 2257) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,216 INFO L246 CegarLoopResult]: For program point L2553(lines 2553 2568) no Hoare annotation was computed. [2019-11-28 01:35:29,216 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 2676) no Hoare annotation was computed. [2019-11-28 01:35:29,217 INFO L242 CegarLoopResult]: At program point L3181-1(lines 3180 3182) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,217 INFO L242 CegarLoopResult]: At program point L3181(lines 3180 3182) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,217 INFO L246 CegarLoopResult]: For program point L2488(line 2488) no Hoare annotation was computed. [2019-11-28 01:35:29,217 INFO L242 CegarLoopResult]: At program point L2356(lines 2299 2365) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,218 INFO L242 CegarLoopResult]: At program point L2158(lines 2155 2160) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,218 INFO L242 CegarLoopResult]: At program point L3149(lines 3148 3150) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,218 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 2676) no Hoare annotation was computed. [2019-11-28 01:35:29,218 INFO L246 CegarLoopResult]: For program point L2555(lines 2555 2565) no Hoare annotation was computed. [2019-11-28 01:35:29,219 INFO L246 CegarLoopResult]: For program point L2489(lines 2489 2504) no Hoare annotation was computed. [2019-11-28 01:35:29,219 INFO L246 CegarLoopResult]: For program point L2556(line 2556) no Hoare annotation was computed. [2019-11-28 01:35:29,219 INFO L246 CegarLoopResult]: For program point L2358(lines 2358 2362) no Hoare annotation was computed. [2019-11-28 01:35:29,219 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 2676) no Hoare annotation was computed. [2019-11-28 01:35:29,219 INFO L246 CegarLoopResult]: For program point L2524(line 2524) no Hoare annotation was computed. [2019-11-28 01:35:29,220 INFO L246 CegarLoopResult]: For program point L2557(lines 2557 2561) no Hoare annotation was computed. [2019-11-28 01:35:29,220 INFO L246 CegarLoopResult]: For program point L2491(lines 2491 2497) no Hoare annotation was computed. [2019-11-28 01:35:29,220 INFO L246 CegarLoopResult]: For program point L2491-2(lines 2489 2503) no Hoare annotation was computed. [2019-11-28 01:35:29,220 INFO L246 CegarLoopResult]: For program point L2326(lines 2326 2330) no Hoare annotation was computed. [2019-11-28 01:35:29,221 INFO L242 CegarLoopResult]: At program point L2359(lines 2299 2365) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,221 INFO L246 CegarLoopResult]: For program point L2326-2(lines 2326 2330) no Hoare annotation was computed. [2019-11-28 01:35:29,221 INFO L242 CegarLoopResult]: At program point L3152(lines 1 3196) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,221 INFO L242 CegarLoopResult]: At program point L3185(lines 3184 3186) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,222 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 2676) no Hoare annotation was computed. [2019-11-28 01:35:29,222 INFO L246 CegarLoopResult]: For program point L2525(lines 2525 2529) no Hoare annotation was computed. [2019-11-28 01:35:29,222 INFO L242 CegarLoopResult]: At program point L2361(lines 2299 2365) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,222 INFO L246 CegarLoopResult]: For program point L2461(line 2461) no Hoare annotation was computed. [2019-11-28 01:35:29,223 INFO L242 CegarLoopResult]: At program point L3188(lines 3187 3189) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,223 INFO L246 CegarLoopResult]: For program point L2462(lines 2462 2467) no Hoare annotation was computed. [2019-11-28 01:35:29,223 INFO L242 CegarLoopResult]: At program point L2231(lines 2227 2233) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,223 INFO L242 CegarLoopResult]: At program point L3156(lines 3155 3157) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,223 INFO L242 CegarLoopResult]: At program point L2165(lines 2161 2167) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,224 INFO L242 CegarLoopResult]: At program point L2364(lines 2288 2366) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,224 INFO L246 CegarLoopResult]: For program point L2992(lines 2992 2995) no Hoare annotation was computed. [2019-11-28 01:35:29,224 INFO L246 CegarLoopResult]: For program point L2992-2(lines 2992 2995) no Hoare annotation was computed. [2019-11-28 01:35:29,224 INFO L246 CegarLoopResult]: For program point L2563(line 2563) no Hoare annotation was computed. [2019-11-28 01:35:29,225 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 01:35:29,225 INFO L242 CegarLoopResult]: At program point L3191-1(lines 3190 3192) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,225 INFO L242 CegarLoopResult]: At program point L3191(lines 3190 3192) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,225 INFO L246 CegarLoopResult]: For program point L2531(line 2531) no Hoare annotation was computed. [2019-11-28 01:35:29,225 INFO L246 CegarLoopResult]: For program point L2267(lines 2267 2270) no Hoare annotation was computed. [2019-11-28 01:35:29,226 INFO L246 CegarLoopResult]: For program point L2267-2(lines 2267 2270) no Hoare annotation was computed. [2019-11-28 01:35:29,226 INFO L246 CegarLoopResult]: For program point L2532(lines 2532 2536) no Hoare annotation was computed. [2019-11-28 01:35:29,226 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 2676) no Hoare annotation was computed. [2019-11-28 01:35:29,226 INFO L242 CegarLoopResult]: At program point L3160(lines 3159 3161) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= ~ldv_mutex_mtx_of_isl_pmic~0 2) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-28 01:35:29,226 INFO L242 CegarLoopResult]: At program point L2500(lines 3115 3118) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,227 INFO L246 CegarLoopResult]: For program point L2335(lines 2335 2341) no Hoare annotation was computed. [2019-11-28 01:35:29,227 INFO L242 CegarLoopResult]: At program point L2997-1(lines 2989 2999) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,227 INFO L242 CegarLoopResult]: At program point L2997(lines 2989 2999) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,227 INFO L246 CegarLoopResult]: For program point L2469(line 2469) no Hoare annotation was computed. [2019-11-28 01:35:29,227 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 01:35:29,228 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 2676) no Hoare annotation was computed. [2019-11-28 01:35:29,228 INFO L242 CegarLoopResult]: At program point L2238(lines 2234 2240) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,228 INFO L242 CegarLoopResult]: At program point L2272(lines 2258 2274) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,228 INFO L242 CegarLoopResult]: At program point L3164(lines 3163 3165) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= ~ldv_mutex_mtx_of_isl_pmic~0 2) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-28 01:35:29,229 INFO L246 CegarLoopResult]: For program point L2570(line 2570) no Hoare annotation was computed. [2019-11-28 01:35:29,229 INFO L246 CegarLoopResult]: For program point L2934(lines 2934 2937) no Hoare annotation was computed. [2019-11-28 01:35:29,229 INFO L246 CegarLoopResult]: For program point L2934-2(lines 2934 2937) no Hoare annotation was computed. [2019-11-28 01:35:29,229 INFO L246 CegarLoopResult]: For program point L2538(line 2538) no Hoare annotation was computed. [2019-11-28 01:35:29,229 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 01:35:29,229 INFO L246 CegarLoopResult]: For program point L2506(line 2506) no Hoare annotation was computed. [2019-11-28 01:35:29,230 INFO L246 CegarLoopResult]: For program point L2539(lines 2539 2543) no Hoare annotation was computed. [2019-11-28 01:35:29,230 INFO L242 CegarLoopResult]: At program point L2407(lines 2403 2409) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,230 INFO L242 CegarLoopResult]: At program point L3167-1(lines 1 3196) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= ~ldv_mutex_mtx_of_isl_pmic~0 2) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-28 01:35:29,230 INFO L242 CegarLoopResult]: At program point L3167(lines 1 3196) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= ~ldv_mutex_mtx_of_isl_pmic~0 2) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-28 01:35:29,231 INFO L242 CegarLoopResult]: At program point L2573(lines 2436 2578) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,231 INFO L242 CegarLoopResult]: At program point L3135(lines 3134 3136) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,231 INFO L246 CegarLoopResult]: For program point L2673-1(lines 1 3196) no Hoare annotation was computed. [2019-11-28 01:35:29,231 INFO L246 CegarLoopResult]: For program point L2673(lines 1 3196) no Hoare annotation was computed. [2019-11-28 01:35:29,231 INFO L246 CegarLoopResult]: For program point L2673-3(lines 1 3196) no Hoare annotation was computed. [2019-11-28 01:35:29,232 INFO L246 CegarLoopResult]: For program point L2673-2(lines 1 3196) no Hoare annotation was computed. [2019-11-28 01:35:29,232 INFO L246 CegarLoopResult]: For program point L2673-5(lines 3123 3126) no Hoare annotation was computed. [2019-11-28 01:35:29,232 INFO L246 CegarLoopResult]: For program point L2673-4(lines 3119 3122) no Hoare annotation was computed. [2019-11-28 01:35:29,232 INFO L249 CegarLoopResult]: At program point L2673-7(lines 3112 3133) the Hoare annotation is: true [2019-11-28 01:35:29,232 INFO L246 CegarLoopResult]: For program point L2673-6(lines 3127 3130) no Hoare annotation was computed. [2019-11-28 01:35:29,233 INFO L246 CegarLoopResult]: For program point L2310(lines 2310 2313) no Hoare annotation was computed. [2019-11-28 01:35:29,233 INFO L242 CegarLoopResult]: At program point L2343(lines 2299 2365) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,233 INFO L246 CegarLoopResult]: For program point L2476(line 2476) no Hoare annotation was computed. [2019-11-28 01:35:29,233 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 01:35:29,233 INFO L246 CegarLoopResult]: For program point L-1-1(line -1) no Hoare annotation was computed. [2019-11-28 01:35:29,234 INFO L242 CegarLoopResult]: At program point L2939-1(lines 2931 2941) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= ~ldv_mutex_mtx_of_isl_pmic~0 2) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-28 01:35:29,234 INFO L242 CegarLoopResult]: At program point L2939(lines 2931 2941) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= ~ldv_mutex_mtx_of_isl_pmic~0 2) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-28 01:35:29,234 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2676) no Hoare annotation was computed. [2019-11-28 01:35:29,234 INFO L246 CegarLoopResult]: For program point L2477(lines 2477 2511) no Hoare annotation was computed. [2019-11-28 01:35:29,234 INFO L242 CegarLoopResult]: At program point L2345(lines 2299 2365) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,235 INFO L246 CegarLoopResult]: For program point L2676(line 2676) no Hoare annotation was computed. [2019-11-28 01:35:29,235 INFO L246 CegarLoopResult]: For program point L2676-2(line 2676) no Hoare annotation was computed. [2019-11-28 01:35:29,235 INFO L246 CegarLoopResult]: For program point L2676-1(line 2676) no Hoare annotation was computed. [2019-11-28 01:35:29,235 INFO L246 CegarLoopResult]: For program point L2676-4(line 2676) no Hoare annotation was computed. [2019-11-28 01:35:29,235 INFO L246 CegarLoopResult]: For program point L2676-3(line 2676) no Hoare annotation was computed. [2019-11-28 01:35:29,236 INFO L249 CegarLoopResult]: At program point L2577(lines 2430 2579) the Hoare annotation is: true [2019-11-28 01:35:29,236 INFO L246 CegarLoopResult]: For program point L2676-6(line 2676) no Hoare annotation was computed. [2019-11-28 01:35:29,236 INFO L246 CegarLoopResult]: For program point L2676-5(line 2676) no Hoare annotation was computed. [2019-11-28 01:35:29,236 INFO L246 CegarLoopResult]: For program point L2445(lines 2445 2572) no Hoare annotation was computed. [2019-11-28 01:35:29,236 INFO L246 CegarLoopResult]: For program point L2676-7(line 2676) no Hoare annotation was computed. [2019-11-28 01:35:29,236 INFO L242 CegarLoopResult]: At program point L2379(lines 2371 2387) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,237 INFO L246 CegarLoopResult]: For program point L2545(line 2545) no Hoare annotation was computed. [2019-11-28 01:35:29,237 INFO L246 CegarLoopResult]: For program point L2446(line 2446) no Hoare annotation was computed. [2019-11-28 01:35:29,237 INFO L246 CegarLoopResult]: For program point L2479(lines 2479 2508) no Hoare annotation was computed. [2019-11-28 01:35:29,237 INFO L242 CegarLoopResult]: At program point L2347(lines 2299 2365) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,237 INFO L242 CegarLoopResult]: At program point L2215(lines 2211 2217) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_retval_1~0 0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-28 01:35:29,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 01:35:29 BoogieIcfgContainer [2019-11-28 01:35:29,278 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 01:35:29,279 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 01:35:29,280 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 01:35:29,280 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 01:35:29,281 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:35:26" (3/4) ... [2019-11-28 01:35:29,288 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 01:35:29,313 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 56 nodes and edges [2019-11-28 01:35:29,315 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2019-11-28 01:35:29,316 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 01:35:29,318 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 01:35:29,319 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 01:35:29,525 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 01:35:29,525 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 01:35:29,529 INFO L168 Benchmark]: Toolchain (without parser) took 6215.07 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 227.5 MB). Free memory was 952.3 MB in the beginning and 1.0 GB in the end (delta: -55.6 MB). Peak memory consumption was 172.0 MB. Max. memory is 11.5 GB. [2019-11-28 01:35:29,529 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 01:35:29,530 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1246.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -119.6 MB). Peak memory consumption was 43.7 MB. Max. memory is 11.5 GB. [2019-11-28 01:35:29,530 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-28 01:35:29,531 INFO L168 Benchmark]: Boogie Preprocessor took 76.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-28 01:35:29,533 INFO L168 Benchmark]: RCFGBuilder took 1434.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 955.7 MB in the end (delta: 102.3 MB). Peak memory consumption was 102.3 MB. Max. memory is 11.5 GB. [2019-11-28 01:35:29,533 INFO L168 Benchmark]: TraceAbstraction took 3102.06 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 98.6 MB). Free memory was 955.7 MB in the beginning and 1.0 GB in the end (delta: -86.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 11.5 GB. [2019-11-28 01:35:29,534 INFO L168 Benchmark]: Witness Printer took 247.10 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 34.1 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. [2019-11-28 01:35:29,536 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1246.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -119.6 MB). Peak memory consumption was 43.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 102.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 76.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1434.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 955.7 MB in the end (delta: 102.3 MB). Peak memory consumption was 102.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3102.06 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 98.6 MB). Free memory was 955.7 MB in the beginning and 1.0 GB in the end (delta: -86.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 11.5 GB. * Witness Printer took 247.10 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 34.1 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2676]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2676]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2676]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2676]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2676]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2676]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2676]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2676]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 3180]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 2299]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 3180]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 3112]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2234]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 3155]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && ldv_state_variable_0 == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && ldv_mutex_mtx_of_isl_pmic == 2) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 3184]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 3159]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && ldv_mutex_mtx_of_isl_pmic == 2) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 2155]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 3148]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 2227]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 2299]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 2371]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && ldv_mutex_mtx_of_isl_pmic == 2) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 2161]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 2299]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 2299]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 2403]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && ldv_state_variable_0 == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 3163]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && ldv_mutex_mtx_of_isl_pmic == 2) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 3102]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && ldv_state_variable_3 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 3141]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 3145]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 3134]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 2258]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 2989]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 2367]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 2288]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 2218]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 3115]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 2299]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 3190]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 2436]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 2371]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 3190]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 2989]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 3176]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 3187]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 2211]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 3176]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 2299]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 2931]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && ldv_mutex_mtx_of_isl_pmic == 2) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 2680]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 2430]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2371]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 2931]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && ldv_mutex_mtx_of_isl_pmic == 2) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 2241]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_retval_1 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 131 locations, 8 error locations. Result: SAFE, OverallTime: 2.2s, OverallIterations: 8, TraceHistogramMax: 2, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, HoareTripleCheckerStatistics: 1324 SDtfs, 985 SDslu, 460 SDs, 0 SdLazy, 55 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=353occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 33 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 50 LocationsWithAnnotation, 50 PreInvPairs, 198 NumberOfFragments, 776 HoareAnnotationTreeSize, 50 FomulaSimplifications, 2013 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 50 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 138 ConstructedInterpolants, 0 QuantifiedInterpolants, 5270 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 3/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...