/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--misc--phantom.ko-main.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 01:10:11,128 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 01:10:11,131 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 01:10:11,147 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 01:10:11,148 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 01:10:11,150 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 01:10:11,152 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 01:10:11,161 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 01:10:11,165 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 01:10:11,167 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 01:10:11,169 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 01:10:11,171 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 01:10:11,171 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 01:10:11,173 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 01:10:11,175 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 01:10:11,177 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 01:10:11,179 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 01:10:11,180 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 01:10:11,181 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 01:10:11,185 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 01:10:11,190 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 01:10:11,194 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 01:10:11,195 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 01:10:11,196 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 01:10:11,198 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 01:10:11,199 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 01:10:11,199 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 01:10:11,201 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 01:10:11,202 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 01:10:11,203 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 01:10:11,203 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 01:10:11,205 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 01:10:11,206 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 01:10:11,207 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 01:10:11,208 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 01:10:11,208 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 01:10:11,209 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 01:10:11,209 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 01:10:11,209 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 01:10:11,210 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 01:10:11,211 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 01:10:11,212 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-24 01:10:11,236 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 01:10:11,236 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 01:10:11,240 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 01:10:11,241 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 01:10:11,241 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 01:10:11,241 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 01:10:11,241 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 01:10:11,241 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 01:10:11,241 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 01:10:11,242 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 01:10:11,242 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 01:10:11,242 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 01:10:11,243 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 01:10:11,243 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 01:10:11,243 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 01:10:11,245 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 01:10:11,245 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 01:10:11,245 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 01:10:11,246 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 01:10:11,246 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 01:10:11,246 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 01:10:11,246 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 01:10:11,246 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 01:10:11,247 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 01:10:11,247 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 01:10:11,247 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 01:10:11,247 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 01:10:11,248 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 01:10:11,249 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 01:10:11,249 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 01:10:11,249 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 01:10:11,249 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 01:10:11,250 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 01:10:11,250 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 01:10:11,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 01:10:11,251 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 01:10:11,251 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 01:10:11,251 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 01:10:11,532 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 01:10:11,555 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 01:10:11,559 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 01:10:11,560 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 01:10:11,560 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 01:10:11,561 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--misc--phantom.ko-main.cil.out.i [2019-11-24 01:10:11,633 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa45fb5f6/afbaa24ad36f4024b5c8e2e62211b19c/FLAG136ccd890 [2019-11-24 01:10:12,352 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 01:10:12,352 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--misc--phantom.ko-main.cil.out.i [2019-11-24 01:10:12,380 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa45fb5f6/afbaa24ad36f4024b5c8e2e62211b19c/FLAG136ccd890 [2019-11-24 01:10:12,467 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa45fb5f6/afbaa24ad36f4024b5c8e2e62211b19c [2019-11-24 01:10:12,476 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 01:10:12,477 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 01:10:12,478 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 01:10:12,478 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 01:10:12,481 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 01:10:12,482 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:10:12" (1/1) ... [2019-11-24 01:10:12,485 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@222013d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:12, skipping insertion in model container [2019-11-24 01:10:12,486 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:10:12" (1/1) ... [2019-11-24 01:10:12,493 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 01:10:12,584 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 01:10:14,108 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 01:10:14,144 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 01:10:14,433 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 01:10:14,641 INFO L208 MainTranslator]: Completed translation [2019-11-24 01:10:14,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:14 WrapperNode [2019-11-24 01:10:14,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 01:10:14,643 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 01:10:14,644 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 01:10:14,644 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 01:10:14,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:14" (1/1) ... [2019-11-24 01:10:14,772 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:14" (1/1) ... [2019-11-24 01:10:15,036 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 01:10:15,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 01:10:15,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 01:10:15,037 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 01:10:15,048 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:14" (1/1) ... [2019-11-24 01:10:15,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:14" (1/1) ... [2019-11-24 01:10:15,094 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:14" (1/1) ... [2019-11-24 01:10:15,094 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:14" (1/1) ... [2019-11-24 01:10:15,218 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:14" (1/1) ... [2019-11-24 01:10:15,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:14" (1/1) ... [2019-11-24 01:10:15,265 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:14" (1/1) ... [2019-11-24 01:10:15,297 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 01:10:15,297 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 01:10:15,297 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 01:10:15,297 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 01:10:15,298 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:14" (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-24 01:10:15,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-11-24 01:10:15,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-24 01:10:15,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-24 01:10:15,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-24 01:10:15,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-24 01:10:15,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-24 01:10:15,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-24 01:10:15,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 01:10:15,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-24 01:10:15,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-24 01:10:15,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-24 01:10:15,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 01:10:15,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-11-24 01:10:15,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 01:10:15,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 01:10:42,678 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 01:10:42,678 INFO L284 CfgBuilder]: Removed 717 assume(true) statements. [2019-11-24 01:10:42,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:10:42 BoogieIcfgContainer [2019-11-24 01:10:42,680 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 01:10:42,681 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 01:10:42,681 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 01:10:42,685 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 01:10:42,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:10:12" (1/3) ... [2019-11-24 01:10:42,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4333bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:10:42, skipping insertion in model container [2019-11-24 01:10:42,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:10:14" (2/3) ... [2019-11-24 01:10:42,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4333bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:10:42, skipping insertion in model container [2019-11-24 01:10:42,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:10:42" (3/3) ... [2019-11-24 01:10:42,692 INFO L109 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--misc--phantom.ko-main.cil.out.i [2019-11-24 01:10:42,703 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 01:10:42,714 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2019-11-24 01:10:42,726 INFO L249 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2019-11-24 01:10:42,762 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 01:10:42,762 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 01:10:42,762 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 01:10:42,763 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 01:10:42,763 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 01:10:42,763 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 01:10:42,763 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 01:10:42,763 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 01:10:42,796 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states. [2019-11-24 01:10:42,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-24 01:10:42,805 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:10:42,806 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:10:42,806 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:10:42,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:10:42,813 INFO L82 PathProgramCache]: Analyzing trace with hash 488573238, now seen corresponding path program 1 times [2019-11-24 01:10:42,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:10:42,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137439924] [2019-11-24 01:10:42,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:10:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:10:43,449 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-24 01:10:43,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137439924] [2019-11-24 01:10:43,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:10:43,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 01:10:43,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309420145] [2019-11-24 01:10:43,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:10:43,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:10:43,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:10:43,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:10:43,475 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 3 states. [2019-11-24 01:10:43,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:10:43,597 INFO L93 Difference]: Finished difference Result 479 states and 782 transitions. [2019-11-24 01:10:43,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:10:43,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-24 01:10:43,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:10:43,632 INFO L225 Difference]: With dead ends: 479 [2019-11-24 01:10:43,632 INFO L226 Difference]: Without dead ends: 309 [2019-11-24 01:10:43,638 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:10:43,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-11-24 01:10:43,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 291. [2019-11-24 01:10:43,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-11-24 01:10:43,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 473 transitions. [2019-11-24 01:10:43,723 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 473 transitions. Word has length 9 [2019-11-24 01:10:43,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:10:43,723 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 473 transitions. [2019-11-24 01:10:43,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:10:43,724 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 473 transitions. [2019-11-24 01:10:43,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-24 01:10:43,725 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:10:43,725 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:10:43,726 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:10:43,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:10:43,727 INFO L82 PathProgramCache]: Analyzing trace with hash -64940534, now seen corresponding path program 1 times [2019-11-24 01:10:43,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:10:43,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628068975] [2019-11-24 01:10:43,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:10:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:10:43,896 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-24 01:10:43,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628068975] [2019-11-24 01:10:43,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:10:43,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 01:10:43,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270764719] [2019-11-24 01:10:43,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:10:43,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:10:43,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:10:43,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:10:43,900 INFO L87 Difference]: Start difference. First operand 291 states and 473 transitions. Second operand 3 states. [2019-11-24 01:10:44,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:10:44,231 INFO L93 Difference]: Finished difference Result 669 states and 1078 transitions. [2019-11-24 01:10:44,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:10:44,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-24 01:10:44,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:10:44,236 INFO L225 Difference]: With dead ends: 669 [2019-11-24 01:10:44,236 INFO L226 Difference]: Without dead ends: 379 [2019-11-24 01:10:44,242 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:10:44,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-11-24 01:10:44,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 364. [2019-11-24 01:10:44,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-11-24 01:10:44,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 590 transitions. [2019-11-24 01:10:44,268 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 590 transitions. Word has length 10 [2019-11-24 01:10:44,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:10:44,268 INFO L462 AbstractCegarLoop]: Abstraction has 364 states and 590 transitions. [2019-11-24 01:10:44,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:10:44,269 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 590 transitions. [2019-11-24 01:10:44,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-24 01:10:44,270 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:10:44,270 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:10:44,271 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:10:44,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:10:44,271 INFO L82 PathProgramCache]: Analyzing trace with hash -923406145, now seen corresponding path program 1 times [2019-11-24 01:10:44,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:10:44,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583312213] [2019-11-24 01:10:44,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:10:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:10:44,407 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-24 01:10:44,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583312213] [2019-11-24 01:10:44,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:10:44,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 01:10:44,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139986821] [2019-11-24 01:10:44,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:10:44,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:10:44,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:10:44,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:10:44,410 INFO L87 Difference]: Start difference. First operand 364 states and 590 transitions. Second operand 3 states. [2019-11-24 01:10:44,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:10:44,423 INFO L93 Difference]: Finished difference Result 364 states and 590 transitions. [2019-11-24 01:10:44,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:10:44,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-24 01:10:44,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:10:44,426 INFO L225 Difference]: With dead ends: 364 [2019-11-24 01:10:44,426 INFO L226 Difference]: Without dead ends: 362 [2019-11-24 01:10:44,427 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:10:44,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-11-24 01:10:44,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2019-11-24 01:10:44,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-11-24 01:10:44,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 588 transitions. [2019-11-24 01:10:44,451 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 588 transitions. Word has length 14 [2019-11-24 01:10:44,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:10:44,451 INFO L462 AbstractCegarLoop]: Abstraction has 362 states and 588 transitions. [2019-11-24 01:10:44,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:10:44,451 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 588 transitions. [2019-11-24 01:10:44,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 01:10:44,456 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:10:44,457 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:10:44,457 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:10:44,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:10:44,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1439180982, now seen corresponding path program 1 times [2019-11-24 01:10:44,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:10:44,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548655874] [2019-11-24 01:10:44,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:10:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:10:44,581 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-24 01:10:44,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548655874] [2019-11-24 01:10:44,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:10:44,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 01:10:44,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353644436] [2019-11-24 01:10:44,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:10:44,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:10:44,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:10:44,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:10:44,584 INFO L87 Difference]: Start difference. First operand 362 states and 588 transitions. Second operand 3 states. [2019-11-24 01:10:44,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:10:44,606 INFO L93 Difference]: Finished difference Result 362 states and 588 transitions. [2019-11-24 01:10:44,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:10:44,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-24 01:10:44,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:10:44,610 INFO L225 Difference]: With dead ends: 362 [2019-11-24 01:10:44,610 INFO L226 Difference]: Without dead ends: 360 [2019-11-24 01:10:44,611 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:10:44,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-11-24 01:10:44,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2019-11-24 01:10:44,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-11-24 01:10:44,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 586 transitions. [2019-11-24 01:10:44,642 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 586 transitions. Word has length 15 [2019-11-24 01:10:44,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:10:44,643 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 586 transitions. [2019-11-24 01:10:44,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:10:44,643 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 586 transitions. [2019-11-24 01:10:44,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 01:10:44,645 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:10:44,645 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:10:44,645 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:10:44,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:10:44,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1664937897, now seen corresponding path program 1 times [2019-11-24 01:10:44,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:10:44,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234158358] [2019-11-24 01:10:44,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:10:44,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:10:44,774 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-24 01:10:44,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234158358] [2019-11-24 01:10:44,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:10:44,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 01:10:44,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719688281] [2019-11-24 01:10:44,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:10:44,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:10:44,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:10:44,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:10:44,778 INFO L87 Difference]: Start difference. First operand 360 states and 586 transitions. Second operand 3 states. [2019-11-24 01:10:44,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:10:44,792 INFO L93 Difference]: Finished difference Result 360 states and 586 transitions. [2019-11-24 01:10:44,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:10:44,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-24 01:10:44,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:10:44,795 INFO L225 Difference]: With dead ends: 360 [2019-11-24 01:10:44,795 INFO L226 Difference]: Without dead ends: 358 [2019-11-24 01:10:44,796 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:10:44,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-11-24 01:10:44,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2019-11-24 01:10:44,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-11-24 01:10:44,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 584 transitions. [2019-11-24 01:10:44,812 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 584 transitions. Word has length 16 [2019-11-24 01:10:44,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:10:44,813 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 584 transitions. [2019-11-24 01:10:44,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:10:44,813 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 584 transitions. [2019-11-24 01:10:44,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 01:10:44,814 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:10:44,814 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:10:44,814 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:10:44,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:10:44,815 INFO L82 PathProgramCache]: Analyzing trace with hash 73467680, now seen corresponding path program 1 times [2019-11-24 01:10:44,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:10:44,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726408048] [2019-11-24 01:10:44,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:10:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:10:44,923 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-24 01:10:44,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726408048] [2019-11-24 01:10:44,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:10:44,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 01:10:44,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384783987] [2019-11-24 01:10:44,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:10:44,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:10:44,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:10:44,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:10:44,926 INFO L87 Difference]: Start difference. First operand 358 states and 584 transitions. Second operand 3 states. [2019-11-24 01:10:45,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:10:45,194 INFO L93 Difference]: Finished difference Result 668 states and 1111 transitions. [2019-11-24 01:10:45,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:10:45,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-24 01:10:45,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:10:45,199 INFO L225 Difference]: With dead ends: 668 [2019-11-24 01:10:45,200 INFO L226 Difference]: Without dead ends: 662 [2019-11-24 01:10:45,201 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:10:45,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-11-24 01:10:45,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 660. [2019-11-24 01:10:45,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-11-24 01:10:45,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1102 transitions. [2019-11-24 01:10:45,240 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1102 transitions. Word has length 17 [2019-11-24 01:10:45,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:10:45,240 INFO L462 AbstractCegarLoop]: Abstraction has 660 states and 1102 transitions. [2019-11-24 01:10:45,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:10:45,241 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1102 transitions. [2019-11-24 01:10:45,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 01:10:45,241 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:10:45,242 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-24 01:10:45,242 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:10:45,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:10:45,242 INFO L82 PathProgramCache]: Analyzing trace with hash -2017468781, now seen corresponding path program 1 times [2019-11-24 01:10:45,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:10:45,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057780562] [2019-11-24 01:10:45,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:10:45,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:10:45,350 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-24 01:10:45,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057780562] [2019-11-24 01:10:45,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:10:45,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 01:10:45,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701572925] [2019-11-24 01:10:45,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:10:45,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:10:45,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:10:45,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:10:45,352 INFO L87 Difference]: Start difference. First operand 660 states and 1102 transitions. Second operand 3 states. [2019-11-24 01:10:45,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:10:45,396 INFO L93 Difference]: Finished difference Result 660 states and 1102 transitions. [2019-11-24 01:10:45,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:10:45,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-24 01:10:45,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:10:45,401 INFO L225 Difference]: With dead ends: 660 [2019-11-24 01:10:45,401 INFO L226 Difference]: Without dead ends: 651 [2019-11-24 01:10:45,402 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:10:45,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-11-24 01:10:45,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-11-24 01:10:45,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-11-24 01:10:45,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1086 transitions. [2019-11-24 01:10:45,435 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1086 transitions. Word has length 18 [2019-11-24 01:10:45,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:10:45,435 INFO L462 AbstractCegarLoop]: Abstraction has 651 states and 1086 transitions. [2019-11-24 01:10:45,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:10:45,436 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1086 transitions. [2019-11-24 01:10:45,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-24 01:10:45,437 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:10:45,437 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:10:45,438 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:10:45,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:10:45,438 INFO L82 PathProgramCache]: Analyzing trace with hash -15794934, now seen corresponding path program 1 times [2019-11-24 01:10:45,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:10:45,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370659136] [2019-11-24 01:10:45,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:10:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:10:45,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 01:10:45,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370659136] [2019-11-24 01:10:45,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:10:45,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 01:10:45,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567556006] [2019-11-24 01:10:45,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:10:45,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:10:45,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:10:45,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:10:45,541 INFO L87 Difference]: Start difference. First operand 651 states and 1086 transitions. Second operand 3 states. [2019-11-24 01:10:45,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:10:45,614 INFO L93 Difference]: Finished difference Result 1281 states and 2127 transitions. [2019-11-24 01:10:45,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:10:45,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-24 01:10:45,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:10:45,618 INFO L225 Difference]: With dead ends: 1281 [2019-11-24 01:10:45,618 INFO L226 Difference]: Without dead ends: 631 [2019-11-24 01:10:45,620 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:10:45,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-11-24 01:10:45,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 577. [2019-11-24 01:10:45,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-11-24 01:10:45,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 976 transitions. [2019-11-24 01:10:45,651 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 976 transitions. Word has length 32 [2019-11-24 01:10:45,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:10:45,652 INFO L462 AbstractCegarLoop]: Abstraction has 577 states and 976 transitions. [2019-11-24 01:10:45,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:10:45,652 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 976 transitions. [2019-11-24 01:10:45,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-24 01:10:45,653 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:10:45,654 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:10:45,654 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:10:45,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:10:45,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1754006670, now seen corresponding path program 1 times [2019-11-24 01:10:45,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:10:45,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930205512] [2019-11-24 01:10:45,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:10:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:10:45,827 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-24 01:10:45,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930205512] [2019-11-24 01:10:45,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:10:45,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 01:10:45,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822426801] [2019-11-24 01:10:45,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:10:45,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:10:45,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:10:45,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:10:45,830 INFO L87 Difference]: Start difference. First operand 577 states and 976 transitions. Second operand 3 states. [2019-11-24 01:10:47,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:10:47,135 INFO L93 Difference]: Finished difference Result 1293 states and 2195 transitions. [2019-11-24 01:10:47,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:10:47,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-24 01:10:47,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:10:47,143 INFO L225 Difference]: With dead ends: 1293 [2019-11-24 01:10:47,143 INFO L226 Difference]: Without dead ends: 729 [2019-11-24 01:10:47,144 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-24 01:10:47,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2019-11-24 01:10:47,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 723. [2019-11-24 01:10:47,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2019-11-24 01:10:47,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1213 transitions. [2019-11-24 01:10:47,175 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1213 transitions. Word has length 43 [2019-11-24 01:10:47,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:10:47,175 INFO L462 AbstractCegarLoop]: Abstraction has 723 states and 1213 transitions. [2019-11-24 01:10:47,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:10:47,175 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1213 transitions. [2019-11-24 01:10:47,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 01:10:47,179 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:10:47,179 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:10:47,179 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:10:47,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:10:47,180 INFO L82 PathProgramCache]: Analyzing trace with hash -605416172, now seen corresponding path program 1 times [2019-11-24 01:10:47,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:10:47,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996699466] [2019-11-24 01:10:47,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:10:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:10:47,442 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-24 01:10:47,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996699466] [2019-11-24 01:10:47,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:10:47,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 01:10:47,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534446051] [2019-11-24 01:10:47,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:10:47,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:10:47,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:10:47,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:10:47,444 INFO L87 Difference]: Start difference. First operand 723 states and 1213 transitions. Second operand 3 states. [2019-11-24 01:10:49,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:10:49,245 INFO L93 Difference]: Finished difference Result 723 states and 1213 transitions. [2019-11-24 01:10:49,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:10:49,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-24 01:10:49,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:10:49,250 INFO L225 Difference]: With dead ends: 723 [2019-11-24 01:10:49,250 INFO L226 Difference]: Without dead ends: 721 [2019-11-24 01:10:49,251 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-24 01:10:49,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2019-11-24 01:10:49,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 721. [2019-11-24 01:10:49,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2019-11-24 01:10:49,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1210 transitions. [2019-11-24 01:10:49,281 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1210 transitions. Word has length 50 [2019-11-24 01:10:49,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:10:49,281 INFO L462 AbstractCegarLoop]: Abstraction has 721 states and 1210 transitions. [2019-11-24 01:10:49,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:10:49,282 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1210 transitions. [2019-11-24 01:10:49,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 01:10:49,283 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:10:49,283 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:10:49,283 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:10:49,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:10:49,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1227992093, now seen corresponding path program 1 times [2019-11-24 01:10:49,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:10:49,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971176628] [2019-11-24 01:10:49,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:10:49,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:10:49,440 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-24 01:10:49,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971176628] [2019-11-24 01:10:49,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:10:49,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 01:10:49,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615676096] [2019-11-24 01:10:49,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:10:49,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:10:49,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:10:49,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:10:49,442 INFO L87 Difference]: Start difference. First operand 721 states and 1210 transitions. Second operand 3 states. [2019-11-24 01:10:50,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:10:50,102 INFO L93 Difference]: Finished difference Result 721 states and 1210 transitions. [2019-11-24 01:10:50,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:10:50,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-24 01:10:50,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:10:50,107 INFO L225 Difference]: With dead ends: 721 [2019-11-24 01:10:50,108 INFO L226 Difference]: Without dead ends: 715 [2019-11-24 01:10:50,108 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-24 01:10:50,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2019-11-24 01:10:50,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2019-11-24 01:10:50,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-11-24 01:10:50,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1201 transitions. [2019-11-24 01:10:50,143 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1201 transitions. Word has length 50 [2019-11-24 01:10:50,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:10:50,144 INFO L462 AbstractCegarLoop]: Abstraction has 715 states and 1201 transitions. [2019-11-24 01:10:50,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:10:50,144 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1201 transitions. [2019-11-24 01:10:50,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-24 01:10:50,145 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:10:50,145 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:10:50,145 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:10:50,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:10:50,146 INFO L82 PathProgramCache]: Analyzing trace with hash 587504008, now seen corresponding path program 1 times [2019-11-24 01:10:50,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:10:50,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207020080] [2019-11-24 01:10:50,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:10:50,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:10:50,290 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-24 01:10:50,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207020080] [2019-11-24 01:10:50,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:10:50,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 01:10:50,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461266407] [2019-11-24 01:10:50,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 01:10:50,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:10:50,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 01:10:50,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:10:50,292 INFO L87 Difference]: Start difference. First operand 715 states and 1201 transitions. Second operand 4 states. [2019-11-24 01:10:50,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:10:50,878 INFO L93 Difference]: Finished difference Result 717 states and 1203 transitions. [2019-11-24 01:10:50,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 01:10:50,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-24 01:10:50,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:10:50,883 INFO L225 Difference]: With dead ends: 717 [2019-11-24 01:10:50,884 INFO L226 Difference]: Without dead ends: 713 [2019-11-24 01:10:50,884 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:10:50,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-11-24 01:10:50,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 711. [2019-11-24 01:10:50,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711 states. [2019-11-24 01:10:50,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1195 transitions. [2019-11-24 01:10:50,930 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1195 transitions. Word has length 51 [2019-11-24 01:10:50,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:10:50,930 INFO L462 AbstractCegarLoop]: Abstraction has 711 states and 1195 transitions. [2019-11-24 01:10:50,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 01:10:50,930 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1195 transitions. [2019-11-24 01:10:50,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-24 01:10:50,932 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:10:50,932 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:10:50,932 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:10:50,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:10:50,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1543645881, now seen corresponding path program 1 times [2019-11-24 01:10:50,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:10:50,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972548609] [2019-11-24 01:10:50,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:10:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:10:51,150 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-24 01:10:51,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972548609] [2019-11-24 01:10:51,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208195319] [2019-11-24 01:10:51,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 01:10:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:10:52,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 1958 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-24 01:10:52,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 01:10:52,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 01:10:52,199 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-24 01:10:52,200 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 01:10:52,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 01:10:52,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 01:10:52,237 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-24 01:10:52,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 01:10:52,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [7] total 9 [2019-11-24 01:10:52,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941933903] [2019-11-24 01:10:52,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 01:10:52,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:10:52,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 01:10:52,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-24 01:10:52,245 INFO L87 Difference]: Start difference. First operand 711 states and 1195 transitions. Second operand 6 states. [2019-11-24 01:11:00,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:11:00,290 INFO L93 Difference]: Finished difference Result 1865 states and 3108 transitions. [2019-11-24 01:11:00,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 01:11:00,290 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-11-24 01:11:00,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:11:00,296 INFO L225 Difference]: With dead ends: 1865 [2019-11-24 01:11:00,296 INFO L226 Difference]: Without dead ends: 1167 [2019-11-24 01:11:00,298 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-24 01:11:00,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2019-11-24 01:11:00,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 666. [2019-11-24 01:11:00,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2019-11-24 01:11:00,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1091 transitions. [2019-11-24 01:11:00,340 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1091 transitions. Word has length 60 [2019-11-24 01:11:00,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:11:00,341 INFO L462 AbstractCegarLoop]: Abstraction has 666 states and 1091 transitions. [2019-11-24 01:11:00,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 01:11:00,341 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1091 transitions. [2019-11-24 01:11:00,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-24 01:11:00,342 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:11:00,342 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:11:00,552 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 01:11:00,553 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:11:00,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:11:00,553 INFO L82 PathProgramCache]: Analyzing trace with hash 39906118, now seen corresponding path program 1 times [2019-11-24 01:11:00,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:11:00,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256937470] [2019-11-24 01:11:00,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:11:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:11:00,854 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-24 01:11:00,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256937470] [2019-11-24 01:11:00,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:11:00,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 01:11:00,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190614571] [2019-11-24 01:11:00,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:11:00,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:11:00,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:11:00,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:11:00,857 INFO L87 Difference]: Start difference. First operand 666 states and 1091 transitions. Second operand 3 states. [2019-11-24 01:11:00,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:11:00,941 INFO L93 Difference]: Finished difference Result 1972 states and 3235 transitions. [2019-11-24 01:11:00,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:11:00,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-11-24 01:11:00,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:11:00,948 INFO L225 Difference]: With dead ends: 1972 [2019-11-24 01:11:00,949 INFO L226 Difference]: Without dead ends: 1319 [2019-11-24 01:11:00,950 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:11:00,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2019-11-24 01:11:01,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 673. [2019-11-24 01:11:01,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2019-11-24 01:11:01,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1098 transitions. [2019-11-24 01:11:01,004 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 1098 transitions. Word has length 62 [2019-11-24 01:11:01,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:11:01,005 INFO L462 AbstractCegarLoop]: Abstraction has 673 states and 1098 transitions. [2019-11-24 01:11:01,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:11:01,005 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 1098 transitions. [2019-11-24 01:11:01,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-24 01:11:01,006 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:11:01,007 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:11:01,007 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:11:01,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:11:01,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1080870328, now seen corresponding path program 1 times [2019-11-24 01:11:01,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:11:01,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708558774] [2019-11-24 01:11:01,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:11:01,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:11:01,386 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-24 01:11:01,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708558774] [2019-11-24 01:11:01,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751542696] [2019-11-24 01:11:01,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 01:11:02,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:11:02,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 2002 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-24 01:11:02,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 01:11:02,248 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-24 01:11:02,248 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 01:11:02,258 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-24 01:11:02,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 01:11:02,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-11-24 01:11:02,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880391014] [2019-11-24 01:11:02,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:11:02,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:11:02,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:11:02,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-24 01:11:02,260 INFO L87 Difference]: Start difference. First operand 673 states and 1098 transitions. Second operand 3 states. [2019-11-24 01:11:02,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:11:02,311 INFO L93 Difference]: Finished difference Result 1333 states and 2177 transitions. [2019-11-24 01:11:02,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:11:02,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-11-24 01:11:02,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:11:02,315 INFO L225 Difference]: With dead ends: 1333 [2019-11-24 01:11:02,315 INFO L226 Difference]: Without dead ends: 673 [2019-11-24 01:11:02,316 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-24 01:11:02,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-11-24 01:11:02,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 673. [2019-11-24 01:11:02,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2019-11-24 01:11:02,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1091 transitions. [2019-11-24 01:11:02,365 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 1091 transitions. Word has length 63 [2019-11-24 01:11:02,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:11:02,365 INFO L462 AbstractCegarLoop]: Abstraction has 673 states and 1091 transitions. [2019-11-24 01:11:02,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:11:02,365 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 1091 transitions. [2019-11-24 01:11:02,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-24 01:11:02,366 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:11:02,366 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:11:02,575 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 01:11:02,575 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:11:02,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:11:02,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1025947090, now seen corresponding path program 1 times [2019-11-24 01:11:02,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:11:02,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317273893] [2019-11-24 01:11:02,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:11:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:11:02,990 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-24 01:11:02,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317273893] [2019-11-24 01:11:02,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918017736] [2019-11-24 01:11:02,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 01:11:03,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:11:03,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 2018 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-24 01:11:03,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 01:11:03,927 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-24 01:11:03,927 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 01:11:03,941 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-24 01:11:03,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 01:11:03,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [4] total 8 [2019-11-24 01:11:03,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293825239] [2019-11-24 01:11:03,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 01:11:03,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:11:03,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 01:11:03,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-24 01:11:03,945 INFO L87 Difference]: Start difference. First operand 673 states and 1091 transitions. Second operand 5 states. [2019-11-24 01:11:04,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:11:04,491 INFO L93 Difference]: Finished difference Result 1359 states and 2190 transitions. [2019-11-24 01:11:04,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 01:11:04,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-24 01:11:04,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:11:04,495 INFO L225 Difference]: With dead ends: 1359 [2019-11-24 01:11:04,495 INFO L226 Difference]: Without dead ends: 679 [2019-11-24 01:11:04,496 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-24 01:11:04,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2019-11-24 01:11:04,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 657. [2019-11-24 01:11:04,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-11-24 01:11:04,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1063 transitions. [2019-11-24 01:11:04,538 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1063 transitions. Word has length 65 [2019-11-24 01:11:04,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:11:04,538 INFO L462 AbstractCegarLoop]: Abstraction has 657 states and 1063 transitions. [2019-11-24 01:11:04,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 01:11:04,539 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1063 transitions. [2019-11-24 01:11:04,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-24 01:11:04,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:11:04,542 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:11:04,751 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 01:11:04,752 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:11:04,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:11:04,752 INFO L82 PathProgramCache]: Analyzing trace with hash -724243148, now seen corresponding path program 1 times [2019-11-24 01:11:04,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:11:04,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268747559] [2019-11-24 01:11:04,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:11:05,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:11:05,170 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-24 01:11:05,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268747559] [2019-11-24 01:11:05,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355719756] [2019-11-24 01:11:05,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 01:11:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:11:06,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 2075 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-24 01:11:06,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 01:11:06,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 01:11:06,160 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-24 01:11:06,160 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 01:11:06,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 01:11:06,189 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-24 01:11:06,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 01:11:06,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 8 [2019-11-24 01:11:06,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589847354] [2019-11-24 01:11:06,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 01:11:06,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:11:06,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 01:11:06,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-24 01:11:06,192 INFO L87 Difference]: Start difference. First operand 657 states and 1063 transitions. Second operand 5 states. [2019-11-24 01:11:07,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:11:07,325 INFO L93 Difference]: Finished difference Result 657 states and 1063 transitions. [2019-11-24 01:11:07,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 01:11:07,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-24 01:11:07,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:11:07,326 INFO L225 Difference]: With dead ends: 657 [2019-11-24 01:11:07,326 INFO L226 Difference]: Without dead ends: 0 [2019-11-24 01:11:07,327 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-24 01:11:07,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-24 01:11:07,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-24 01:11:07,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-24 01:11:07,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-24 01:11:07,328 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2019-11-24 01:11:07,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:11:07,328 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-24 01:11:07,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 01:11:07,329 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-24 01:11:07,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-24 01:11:07,537 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 01:11:07,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-24 01:11:09,638 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 21 [2019-11-24 01:11:10,024 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 21 [2019-11-24 01:11:10,256 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 21 [2019-11-24 01:11:10,647 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 18 [2019-11-24 01:11:10,816 INFO L444 ceAbstractionStarter]: For program point L3801(lines 3801 3805) no Hoare annotation was computed. [2019-11-24 01:11:10,817 INFO L444 ceAbstractionStarter]: For program point L3405-1(lines 3405 3408) no Hoare annotation was computed. [2019-11-24 01:11:10,817 INFO L444 ceAbstractionStarter]: For program point L3405(lines 3405 3408) no Hoare annotation was computed. [2019-11-24 01:11:10,817 INFO L440 ceAbstractionStarter]: At program point L4199(line 4199) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,818 INFO L440 ceAbstractionStarter]: At program point L4200(lines 4200 4208) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,818 INFO L440 ceAbstractionStarter]: At program point L3409-1(lines 3409 3412) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,818 INFO L440 ceAbstractionStarter]: At program point L3409(lines 3409 3412) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,819 INFO L440 ceAbstractionStarter]: At program point L3807(lines 3807 3812) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,819 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 4417) no Hoare annotation was computed. [2019-11-24 01:11:10,819 INFO L440 ceAbstractionStarter]: At program point L3415-2(lines 3415 3423) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,819 INFO L440 ceAbstractionStarter]: At program point L3415-4(lines 3415 3423) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,819 INFO L440 ceAbstractionStarter]: At program point L3415-7(lines 3415 3423) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,820 INFO L440 ceAbstractionStarter]: At program point L3415-9(lines 3415 3423) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,820 INFO L440 ceAbstractionStarter]: At program point L3417-1(lines 3417 3421) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,820 INFO L440 ceAbstractionStarter]: At program point L3417(lines 3417 3421) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,820 INFO L440 ceAbstractionStarter]: At program point L4078(line 4078) the Hoare annotation is: (let ((.cse0 (= 1 ~ldv_mutex_lock~0)) (.cse1 (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0)) (.cse2 (= ~ldv_mutex_phantom_mutex~0 1)) (.cse3 (= 1 ~ldv_mutex_mutex_of_device~0)) (.cse4 (= ~ldv_mutex_open_lock_of_phantom_device~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) (and .cse0 .cse1 .cse2 (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_0~0 1) (= ~ldv_state_variable_3~0 0) .cse3 .cse4))) [2019-11-24 01:11:10,820 INFO L440 ceAbstractionStarter]: At program point L3815(lines 3815 3819) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,820 INFO L444 ceAbstractionStarter]: For program point L4745(lines 4745 4748) no Hoare annotation was computed. [2019-11-24 01:11:10,820 INFO L444 ceAbstractionStarter]: For program point L4879(lines 4879 4882) no Hoare annotation was computed. [2019-11-24 01:11:10,821 INFO L440 ceAbstractionStarter]: At program point L3558(lines 3401 3587) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,821 INFO L440 ceAbstractionStarter]: At program point L3558-1(lines 3401 3587) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,821 INFO L440 ceAbstractionStarter]: At program point L3823(lines 3823 3827) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,821 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 4417) no Hoare annotation was computed. [2019-11-24 01:11:10,821 INFO L440 ceAbstractionStarter]: At program point L5150(lines 1 5152) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,822 INFO L440 ceAbstractionStarter]: At program point L3829(lines 3829 3833) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,822 INFO L440 ceAbstractionStarter]: At program point L-1-2(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,822 INFO L440 ceAbstractionStarter]: At program point L-1-4(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,822 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4417) no Hoare annotation was computed. [2019-11-24 01:11:10,822 INFO L440 ceAbstractionStarter]: At program point L-1-7(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,822 INFO L440 ceAbstractionStarter]: At program point L-1-9(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,823 INFO L440 ceAbstractionStarter]: At program point L-1-14(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,823 INFO L440 ceAbstractionStarter]: At program point L-1-16(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,823 INFO L440 ceAbstractionStarter]: At program point L-1-19(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,823 INFO L440 ceAbstractionStarter]: At program point L-1-21(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,823 INFO L444 ceAbstractionStarter]: For program point L4096(line 4096) no Hoare annotation was computed. [2019-11-24 01:11:10,823 INFO L444 ceAbstractionStarter]: For program point L3568(lines 3568 3571) no Hoare annotation was computed. [2019-11-24 01:11:10,823 INFO L444 ceAbstractionStarter]: For program point L3568-1(lines 3568 3571) no Hoare annotation was computed. [2019-11-24 01:11:10,824 INFO L444 ceAbstractionStarter]: For program point L4097(lines 4097 4130) no Hoare annotation was computed. [2019-11-24 01:11:10,824 INFO L444 ceAbstractionStarter]: For program point L4100(line 4100) no Hoare annotation was computed. [2019-11-24 01:11:10,824 INFO L440 ceAbstractionStarter]: At program point L3836(lines 3836 3840) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,824 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 4417) no Hoare annotation was computed. [2019-11-24 01:11:10,824 INFO L440 ceAbstractionStarter]: At program point L4101(lines 4101 4106) the Hoare annotation is: (let ((.cse0 (= 1 ~ldv_mutex_lock~0)) (.cse1 (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0)) (.cse2 (= ~ldv_mutex_phantom_mutex~0 1)) (.cse3 (= 1 ~ldv_mutex_mutex_of_device~0)) (.cse4 (= ~ldv_mutex_open_lock_of_phantom_device~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) (and .cse0 .cse1 .cse2 (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_0~0 1) (= ~ldv_state_variable_3~0 0) .cse3 .cse4))) [2019-11-24 01:11:10,824 INFO L440 ceAbstractionStarter]: At program point L3573-1(line 3573) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,824 INFO L440 ceAbstractionStarter]: At program point L3573(line 3573) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,825 INFO L440 ceAbstractionStarter]: At program point L3576(lines 3576 3581) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,825 INFO L440 ceAbstractionStarter]: At program point L3576-1(lines 3576 3581) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,825 INFO L440 ceAbstractionStarter]: At program point L3843(lines 3843 3847) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,825 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 4417) no Hoare annotation was computed. [2019-11-24 01:11:10,825 INFO L444 ceAbstractionStarter]: For program point L4108(line 4108) no Hoare annotation was computed. [2019-11-24 01:11:10,825 INFO L440 ceAbstractionStarter]: At program point L4109(lines 4109 4123) the Hoare annotation is: (let ((.cse0 (= 1 ~ldv_mutex_lock~0)) (.cse1 (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0)) (.cse2 (= ~ldv_mutex_phantom_mutex~0 1)) (.cse3 (= 1 ~ldv_mutex_mutex_of_device~0)) (.cse4 (= ~ldv_mutex_open_lock_of_phantom_device~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) (and .cse0 .cse1 .cse2 (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_0~0 1) (= ~ldv_state_variable_3~0 0) .cse3 .cse4))) [2019-11-24 01:11:10,825 INFO L440 ceAbstractionStarter]: At program point L3450(line 3450) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,826 INFO L440 ceAbstractionStarter]: At program point L3450-1(line 3450) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,826 INFO L444 ceAbstractionStarter]: For program point L4111-2(lines 4109 4122) no Hoare annotation was computed. [2019-11-24 01:11:10,826 INFO L440 ceAbstractionStarter]: At program point L3979(lines 3979 3985) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,826 INFO L440 ceAbstractionStarter]: At program point L3452(lines 3452 3455) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,826 INFO L440 ceAbstractionStarter]: At program point L3452-1(lines 3452 3455) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,826 INFO L444 ceAbstractionStarter]: For program point L3585-1(line 3585) no Hoare annotation was computed. [2019-11-24 01:11:10,826 INFO L444 ceAbstractionStarter]: For program point L3585(line 3585) no Hoare annotation was computed. [2019-11-24 01:11:10,826 INFO L444 ceAbstractionStarter]: For program point L4777(lines 4777 4780) no Hoare annotation was computed. [2019-11-24 01:11:10,827 INFO L440 ceAbstractionStarter]: At program point L3588(lines 3398 3590) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,827 INFO L440 ceAbstractionStarter]: At program point L3588-1(lines 3398 3590) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,827 INFO L440 ceAbstractionStarter]: At program point L3589-1(lines 3364 3591) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,827 INFO L440 ceAbstractionStarter]: At program point L3589(lines 3364 3591) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,827 INFO L440 ceAbstractionStarter]: At program point L4119(lines 4959 4962) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1)) [2019-11-24 01:11:10,827 INFO L440 ceAbstractionStarter]: At program point L3987(lines 3987 3991) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,827 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 4417) no Hoare annotation was computed. [2019-11-24 01:11:10,828 INFO L440 ceAbstractionStarter]: At program point L5045-1(lines 1 5152) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (not (= 0 ULTIMATE.start_phantom_init_~retval~1)) (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,828 INFO L440 ceAbstractionStarter]: At program point L4254(lines 4068 4259) the Hoare annotation is: (let ((.cse0 (= 1 ~ldv_mutex_lock~0)) (.cse1 (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0)) (.cse2 (= ~ldv_mutex_phantom_mutex~0 1)) (.cse3 (= 1 ~ldv_mutex_mutex_of_device~0)) (.cse4 (= ~ldv_mutex_open_lock_of_phantom_device~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) (and .cse0 .cse1 .cse2 (= ~ldv_state_variable_2~0 0) (= ~ldv_state_variable_0~0 1) (= ~ldv_state_variable_3~0 0) .cse3 .cse4))) [2019-11-24 01:11:10,828 INFO L440 ceAbstractionStarter]: At program point L3858(lines 3858 3862) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ~ldv_state_variable_3~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,828 INFO L440 ceAbstractionStarter]: At program point L5048-1(lines 1 5152) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (not (= 0 ULTIMATE.start_phantom_init_~retval~1)) (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,828 INFO L440 ceAbstractionStarter]: At program point L3993(lines 3993 3997) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,828 INFO L440 ceAbstractionStarter]: At program point L3864(lines 3864 3868) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ~ldv_state_variable_3~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,828 INFO L444 ceAbstractionStarter]: For program point L3469-1(lines 3469 3501) no Hoare annotation was computed. [2019-11-24 01:11:10,829 INFO L444 ceAbstractionStarter]: For program point L3469(lines 3469 3501) no Hoare annotation was computed. [2019-11-24 01:11:10,829 INFO L444 ceAbstractionStarter]: For program point L3469-3(lines 3469 3501) no Hoare annotation was computed. [2019-11-24 01:11:10,829 INFO L444 ceAbstractionStarter]: For program point L3469-2(lines 3469 3501) no Hoare annotation was computed. [2019-11-24 01:11:10,829 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 4417) no Hoare annotation was computed. [2019-11-24 01:11:10,829 INFO L444 ceAbstractionStarter]: For program point L3471(lines 3471 3475) no Hoare annotation was computed. [2019-11-24 01:11:10,829 INFO L444 ceAbstractionStarter]: For program point L3471-3(lines 3471 3475) no Hoare annotation was computed. [2019-11-24 01:11:10,829 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 4417) no Hoare annotation was computed. [2019-11-24 01:11:10,829 INFO L444 ceAbstractionStarter]: For program point L4132(line 4132) no Hoare annotation was computed. [2019-11-24 01:11:10,829 INFO L440 ceAbstractionStarter]: At program point L4000(lines 4000 4004) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,830 INFO L444 ceAbstractionStarter]: For program point L4133(lines 4133 4193) no Hoare annotation was computed. [2019-11-24 01:11:10,830 INFO L444 ceAbstractionStarter]: For program point L4136(line 4136) no Hoare annotation was computed. [2019-11-24 01:11:10,830 INFO L444 ceAbstractionStarter]: For program point L4137(lines 4137 4142) no Hoare annotation was computed. [2019-11-24 01:11:10,830 INFO L440 ceAbstractionStarter]: At program point L4009(lines 3975 4015) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (not (= 0 ULTIMATE.start_phantom_init_~retval~1)) (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,830 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 4417) no Hoare annotation was computed. [2019-11-24 01:11:10,830 INFO L444 ceAbstractionStarter]: For program point L4144(line 4144) no Hoare annotation was computed. [2019-11-24 01:11:10,830 INFO L444 ceAbstractionStarter]: For program point L4937-2(lines 4937 4940) no Hoare annotation was computed. [2019-11-24 01:11:10,830 INFO L440 ceAbstractionStarter]: At program point L3880(lines 3799 3896) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ~ldv_state_variable_3~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,831 INFO L444 ceAbstractionStarter]: For program point L4937(lines 4937 4940) no Hoare annotation was computed. [2019-11-24 01:11:10,831 INFO L444 ceAbstractionStarter]: For program point L4937-4(lines 4937 4940) no Hoare annotation was computed. [2019-11-24 01:11:10,831 INFO L440 ceAbstractionStarter]: At program point L4145(lines 4145 4149) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,831 INFO L440 ceAbstractionStarter]: At program point L4014(lines 3968 4016) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,831 INFO L440 ceAbstractionStarter]: At program point L3882(lines 3799 3896) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,831 INFO L444 ceAbstractionStarter]: For program point L3618(lines 3618 3622) no Hoare annotation was computed. [2019-11-24 01:11:10,831 INFO L440 ceAbstractionStarter]: At program point L3884(lines 3799 3896) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,831 INFO L440 ceAbstractionStarter]: At program point L4414(lines 1 5152) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,832 INFO L440 ceAbstractionStarter]: At program point L4414-3(lines 1 5152) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 2) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ~ldv_state_variable_3~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,832 INFO L440 ceAbstractionStarter]: At program point L4414-4(lines 1 5152) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= (+ ULTIMATE.start_phantom_open_~tmp~9 4) 0) (= ~ldv_mutex_phantom_mutex~0 2) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ~ldv_state_variable_3~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,832 INFO L440 ceAbstractionStarter]: At program point L4414-1(lines 1 5152) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 2) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,832 INFO L440 ceAbstractionStarter]: At program point L4414-2(lines 1 5152) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ~ldv_state_variable_3~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,832 INFO L440 ceAbstractionStarter]: At program point L4414-7(lines 1 5152) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 2) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 2) (= 1 ~ldv_mutex_mutex_of_device~0) (= 0 ULTIMATE.start_phantom_open_~tmp~9) (= ~ldv_state_variable_3~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,832 INFO L440 ceAbstractionStarter]: At program point L4414-8(lines 1 5152) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 2) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ~ldv_state_variable_3~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,833 INFO L440 ceAbstractionStarter]: At program point L4414-5(lines 1 5152) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 2) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 2) (= 1 ~ldv_mutex_mutex_of_device~0) (= 0 ULTIMATE.start_phantom_open_~tmp~9) (= ~ldv_state_variable_3~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,833 INFO L440 ceAbstractionStarter]: At program point L4414-6(lines 1 5152) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 2) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ~ldv_state_variable_3~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,833 INFO L444 ceAbstractionStarter]: For program point L4414-11(lines 4971 4974) no Hoare annotation was computed. [2019-11-24 01:11:10,833 INFO L444 ceAbstractionStarter]: For program point L4414-12(lines 4975 4978) no Hoare annotation was computed. [2019-11-24 01:11:10,833 INFO L444 ceAbstractionStarter]: For program point L4414-9(lines 4963 4966) no Hoare annotation was computed. [2019-11-24 01:11:10,833 INFO L444 ceAbstractionStarter]: For program point L4414-10(lines 4967 4970) no Hoare annotation was computed. [2019-11-24 01:11:10,833 INFO L440 ceAbstractionStarter]: At program point L3886(lines 3799 3896) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,833 INFO L447 ceAbstractionStarter]: At program point L4414-13(lines 4956 4981) the Hoare annotation is: true [2019-11-24 01:11:10,834 INFO L440 ceAbstractionStarter]: At program point L4151(line 4151) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,834 INFO L440 ceAbstractionStarter]: At program point L3623(lines 3623 3628) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 2) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 2) (= 1 ~ldv_mutex_mutex_of_device~0) (= 0 ULTIMATE.start_phantom_open_~tmp~9) (= ~ldv_state_variable_3~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,834 INFO L444 ceAbstractionStarter]: For program point L4417-2(line 4417) no Hoare annotation was computed. [2019-11-24 01:11:10,834 INFO L444 ceAbstractionStarter]: For program point L4417-3(line 4417) no Hoare annotation was computed. [2019-11-24 01:11:10,834 INFO L444 ceAbstractionStarter]: For program point L4417(line 4417) no Hoare annotation was computed. [2019-11-24 01:11:10,834 INFO L444 ceAbstractionStarter]: For program point L4417-1(line 4417) no Hoare annotation was computed. [2019-11-24 01:11:10,834 INFO L444 ceAbstractionStarter]: For program point L4417-6(line 4417) no Hoare annotation was computed. [2019-11-24 01:11:10,834 INFO L444 ceAbstractionStarter]: For program point L4417-7(line 4417) no Hoare annotation was computed. [2019-11-24 01:11:10,834 INFO L444 ceAbstractionStarter]: For program point L4417-4(line 4417) no Hoare annotation was computed. [2019-11-24 01:11:10,835 INFO L444 ceAbstractionStarter]: For program point L4417-5(line 4417) no Hoare annotation was computed. [2019-11-24 01:11:10,835 INFO L444 ceAbstractionStarter]: For program point L4417-10(line 4417) no Hoare annotation was computed. [2019-11-24 01:11:10,835 INFO L444 ceAbstractionStarter]: For program point L4417-11(line 4417) no Hoare annotation was computed. [2019-11-24 01:11:10,835 INFO L444 ceAbstractionStarter]: For program point L4417-8(line 4417) no Hoare annotation was computed. [2019-11-24 01:11:10,835 INFO L444 ceAbstractionStarter]: For program point L4417-9(line 4417) no Hoare annotation was computed. [2019-11-24 01:11:10,835 INFO L444 ceAbstractionStarter]: For program point L4417-12(line 4417) no Hoare annotation was computed. [2019-11-24 01:11:10,835 INFO L444 ceAbstractionStarter]: For program point L4417-13(line 4417) no Hoare annotation was computed. [2019-11-24 01:11:10,835 INFO L440 ceAbstractionStarter]: At program point L3493-1(lines 3476 3501) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,835 INFO L440 ceAbstractionStarter]: At program point L3493(lines 3476 3501) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,836 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-24 01:11:10,836 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 4417) no Hoare annotation was computed. [2019-11-24 01:11:10,836 INFO L440 ceAbstractionStarter]: At program point L3892(lines 3799 3896) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,836 INFO L440 ceAbstractionStarter]: At program point L3895(lines 3787 3897) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,836 INFO L440 ceAbstractionStarter]: At program point L4163(line 4163) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,836 INFO L440 ceAbstractionStarter]: At program point L3505-1(line 3505) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,836 INFO L440 ceAbstractionStarter]: At program point L3505(line 3505) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,837 INFO L444 ceAbstractionStarter]: For program point L3507-1(lines 3507 3510) no Hoare annotation was computed. [2019-11-24 01:11:10,837 INFO L444 ceAbstractionStarter]: For program point L3507(lines 3507 3510) no Hoare annotation was computed. [2019-11-24 01:11:10,837 INFO L444 ceAbstractionStarter]: For program point L3772(lines 3772 3775) no Hoare annotation was computed. [2019-11-24 01:11:10,837 INFO L444 ceAbstractionStarter]: For program point L4170(line 4170) no Hoare annotation was computed. [2019-11-24 01:11:10,837 INFO L440 ceAbstractionStarter]: At program point L3642(lines 3606 3644) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ~ldv_state_variable_3~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,837 INFO L444 ceAbstractionStarter]: For program point L4171(lines 4171 4179) no Hoare annotation was computed. [2019-11-24 01:11:10,837 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 4417) no Hoare annotation was computed. [2019-11-24 01:11:10,837 INFO L440 ceAbstractionStarter]: At program point L3511-1(lines 3511 3514) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,838 INFO L440 ceAbstractionStarter]: At program point L3511(lines 3511 3514) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,838 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 4417) no Hoare annotation was computed. [2019-11-24 01:11:10,838 INFO L440 ceAbstractionStarter]: At program point L3777(lines 3768 3785) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,838 INFO L444 ceAbstractionStarter]: For program point L4835(lines 4835 4838) no Hoare annotation was computed. [2019-11-24 01:11:10,838 INFO L444 ceAbstractionStarter]: For program point L4835-4(lines 4835 4838) no Hoare annotation was computed. [2019-11-24 01:11:10,838 INFO L444 ceAbstractionStarter]: For program point L4835-2(lines 4835 4838) no Hoare annotation was computed. [2019-11-24 01:11:10,838 INFO L440 ceAbstractionStarter]: At program point L3781(lines 3768 3785) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,838 INFO L444 ceAbstractionStarter]: For program point L3517-1(lines 3517 3520) no Hoare annotation was computed. [2019-11-24 01:11:10,839 INFO L444 ceAbstractionStarter]: For program point L3517(lines 3517 3520) no Hoare annotation was computed. [2019-11-24 01:11:10,839 INFO L440 ceAbstractionStarter]: At program point L5103(lines 1 5152) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,839 INFO L444 ceAbstractionStarter]: For program point L4181(line 4181) no Hoare annotation was computed. [2019-11-24 01:11:10,839 INFO L447 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-24 01:11:10,839 INFO L444 ceAbstractionStarter]: For program point L4182(lines 4182 4186) no Hoare annotation was computed. [2019-11-24 01:11:10,839 INFO L440 ceAbstractionStarter]: At program point L3523-1(line 3523) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,839 INFO L440 ceAbstractionStarter]: At program point L3523(line 3523) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,840 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 4417) no Hoare annotation was computed. [2019-11-24 01:11:10,840 INFO L440 ceAbstractionStarter]: At program point L3525-1(lines 3525 3528) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,840 INFO L440 ceAbstractionStarter]: At program point L3525(lines 3525 3528) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,840 INFO L440 ceAbstractionStarter]: At program point L5116(lines 1 5152) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,840 INFO L444 ceAbstractionStarter]: For program point L4195(line 4195) no Hoare annotation was computed. [2019-11-24 01:11:10,840 INFO L440 ceAbstractionStarter]: At program point L3403-1(line 3403) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,840 INFO L440 ceAbstractionStarter]: At program point L3403(line 3403) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_phantom_mutex~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_open_lock_of_phantom_device~0 1) (= ULTIMATE.start_phantom_init_~tmp___1~4 0)) [2019-11-24 01:11:10,841 INFO L444 ceAbstractionStarter]: For program point L4196(lines 4196 4249) no Hoare annotation was computed. [2019-11-24 01:11:10,841 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 4417) no Hoare annotation was computed. [2019-11-24 01:11:10,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 01:11:10 BoogieIcfgContainer [2019-11-24 01:11:10,893 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-24 01:11:10,894 INFO L168 Benchmark]: Toolchain (without parser) took 58417.55 ms. Allocated memory was 140.0 MB in the beginning and 845.2 MB in the end (delta: 705.2 MB). Free memory was 98.1 MB in the beginning and 582.3 MB in the end (delta: -484.2 MB). Peak memory consumption was 659.6 MB. Max. memory is 7.1 GB. [2019-11-24 01:11:10,895 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 140.0 MB. Free memory is still 123.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-24 01:11:10,895 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2165.10 ms. Allocated memory was 140.0 MB in the beginning and 240.1 MB in the end (delta: 100.1 MB). Free memory was 97.9 MB in the beginning and 190.3 MB in the end (delta: -92.4 MB). Peak memory consumption was 86.4 MB. Max. memory is 7.1 GB. [2019-11-24 01:11:10,896 INFO L168 Benchmark]: Boogie Procedure Inliner took 392.54 ms. Allocated memory is still 240.1 MB. Free memory was 190.3 MB in the beginning and 168.3 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-11-24 01:11:10,897 INFO L168 Benchmark]: Boogie Preprocessor took 260.61 ms. Allocated memory is still 240.1 MB. Free memory was 168.3 MB in the beginning and 147.8 MB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-11-24 01:11:10,897 INFO L168 Benchmark]: RCFGBuilder took 27383.17 ms. Allocated memory was 240.1 MB in the beginning and 502.3 MB in the end (delta: 262.1 MB). Free memory was 147.8 MB in the beginning and 60.6 MB in the end (delta: 87.3 MB). Peak memory consumption was 358.6 MB. Max. memory is 7.1 GB. [2019-11-24 01:11:10,898 INFO L168 Benchmark]: TraceAbstraction took 28211.62 ms. Allocated memory was 502.3 MB in the beginning and 845.2 MB in the end (delta: 342.9 MB). Free memory was 60.6 MB in the beginning and 582.3 MB in the end (delta: -521.8 MB). Peak memory consumption was 259.8 MB. Max. memory is 7.1 GB. [2019-11-24 01:11:10,901 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 140.0 MB. Free memory is still 123.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2165.10 ms. Allocated memory was 140.0 MB in the beginning and 240.1 MB in the end (delta: 100.1 MB). Free memory was 97.9 MB in the beginning and 190.3 MB in the end (delta: -92.4 MB). Peak memory consumption was 86.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 392.54 ms. Allocated memory is still 240.1 MB. Free memory was 190.3 MB in the beginning and 168.3 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 260.61 ms. Allocated memory is still 240.1 MB. Free memory was 168.3 MB in the beginning and 147.8 MB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 27383.17 ms. Allocated memory was 240.1 MB in the beginning and 502.3 MB in the end (delta: 262.1 MB). Free memory was 147.8 MB in the beginning and 60.6 MB in the end (delta: 87.3 MB). Peak memory consumption was 358.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28211.62 ms. Allocated memory was 502.3 MB in the beginning and 845.2 MB in the end (delta: 342.9 MB). Free memory was 60.6 MB in the beginning and 582.3 MB in the end (delta: -521.8 MB). Peak memory consumption was 259.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4417]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4417]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4417]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4417]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4417]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4417]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4417]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4417]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4417]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4417]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4417]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4417]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4417]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4417]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 3576]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 2) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && ldv_state_variable_3 == 1) && tmp___1 == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((1 == ldv_mutex_lock && ldv_mutex_open_lock_of_phantom_device == 2) && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 2) && 1 == ldv_mutex_mutex_of_device) && 0 == tmp) && ldv_state_variable_3 == 1) && tmp___1 == 0 - InvariantResult [Line: 3576]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3993]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && ldv_state_variable_0 == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3525]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((1 == ldv_mutex_lock && ldv_mutex_open_lock_of_phantom_device == 2) && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 2) && 1 == ldv_mutex_mutex_of_device) && 0 == tmp) && ldv_state_variable_3 == 1) && tmp___1 == 0 - InvariantResult [Line: 3843]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 4000]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && ldv_state_variable_0 == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3415]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3768]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 2) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && ldv_state_variable_3 == 1) && tmp___1 == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && ldv_mutex_open_lock_of_phantom_device == 2) && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && tmp___1 == 0 - InvariantResult [Line: 3799]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && ldv_state_variable_3 == 1) && tmp___1 == 0 - InvariantResult [Line: 3858]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && ldv_state_variable_3 == 1) && tmp___1 == 0 - InvariantResult [Line: 3573]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3768]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3525]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3401]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3606]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && ldv_state_variable_3 == 1) && tmp___1 == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && tmp + 4 == 0) && ldv_mutex_phantom_mutex == 2) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && ldv_state_variable_3 == 1) && tmp___1 == 0 - InvariantResult [Line: 3452]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && ldv_state_variable_3 == 1) && tmp___1 == 0 - InvariantResult [Line: 3836]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3401]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 2) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && ldv_state_variable_3 == 1) && tmp___1 == 0 - InvariantResult [Line: 3452]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 4151]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3787]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3511]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3398]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3476]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 4078]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0) || (((((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && ldv_state_variable_2 == 0) && ldv_state_variable_0 == 1) && ldv_state_variable_3 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) - InvariantResult [Line: 3398]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3829]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3573]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3807]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3799]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3979]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && ldv_state_variable_0 == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3511]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 4199]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3815]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3975]: Loop Invariant Derived loop invariant: ((((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && !(0 == retval)) && ldv_state_variable_0 == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3799]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3987]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && ldv_state_variable_0 == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 4068]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0) || (((((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && ldv_state_variable_2 == 0) && ldv_state_variable_0 == 1) && ldv_state_variable_3 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) - InvariantResult [Line: 3409]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3476]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3409]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3417]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && !(0 == retval)) && ldv_state_variable_0 == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 4959]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1 - InvariantResult [Line: 3523]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3364]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3417]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3450]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 4163]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3523]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 4200]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && !(0 == retval)) && ldv_state_variable_0 == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 4101]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0) || (((((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && ldv_state_variable_2 == 0) && ldv_state_variable_0 == 1) && ldv_state_variable_3 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) - InvariantResult [Line: 3505]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3364]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3450]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3823]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 4145]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3505]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 4109]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0) || (((((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && ldv_state_variable_2 == 0) && ldv_state_variable_0 == 1) && ldv_state_variable_3 == 0) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) - InvariantResult [Line: 3864]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && ldv_state_variable_3 == 1) && tmp___1 == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3415]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3968]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && ldv_state_variable_0 == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3799]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3403]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3799]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3403]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3623]: Loop Invariant Derived loop invariant: ((((((1 == ldv_mutex_lock && ldv_mutex_open_lock_of_phantom_device == 2) && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 2) && 1 == ldv_mutex_mutex_of_device) && 0 == tmp) && ldv_state_variable_3 == 1) && tmp___1 == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3415]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 3415]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_phantom_mutex == 1) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_open_lock_of_phantom_device == 1) && tmp___1 == 0 - InvariantResult [Line: 4956]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 169 locations, 14 error locations. Result: SAFE, OverallTime: 28.0s, OverallIterations: 17, TraceHistogramMax: 4, AutomataDifference: 15.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.2s, HoareTripleCheckerStatistics: 4871 SDtfs, 3272 SDslu, 4051 SDs, 0 SdLazy, 279 SolverSat, 79 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 13.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 561 GetRequests, 516 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=723occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 1266 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 92 LocationsWithAnnotation, 92 PreInvPairs, 491 NumberOfFragments, 1899 HoareAnnotationTreeSize, 92 FomulaSimplifications, 36705 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 92 FomulaSimplificationsInter, 1706 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 893 NumberOfCodeBlocks, 893 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1121 ConstructedInterpolants, 0 QuantifiedInterpolants, 123458 SizeOfPredicates, 18 NumberOfNonLiveVariables, 8053 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 25 InterpolantComputations, 21 PerfectInterpolantSequences, 289/337 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...