/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--regulator--isl6271a-regulator.ko-main.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 01:11:08,106 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 01:11:08,109 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 01:11:08,123 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 01:11:08,124 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 01:11:08,125 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 01:11:08,126 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 01:11:08,128 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 01:11:08,129 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 01:11:08,130 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 01:11:08,131 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 01:11:08,132 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 01:11:08,132 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 01:11:08,133 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 01:11:08,134 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 01:11:08,136 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 01:11:08,136 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 01:11:08,137 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 01:11:08,139 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 01:11:08,141 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 01:11:08,143 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 01:11:08,144 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 01:11:08,145 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 01:11:08,145 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 01:11:08,148 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 01:11:08,148 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 01:11:08,148 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 01:11:08,149 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 01:11:08,150 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 01:11:08,151 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 01:11:08,151 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 01:11:08,151 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 01:11:08,152 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 01:11:08,153 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 01:11:08,154 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 01:11:08,154 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 01:11:08,155 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 01:11:08,155 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 01:11:08,155 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 01:11:08,156 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 01:11:08,157 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 01:11:08,158 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:11:08,177 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 01:11:08,178 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 01:11:08,178 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 01:11:08,179 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 01:11:08,179 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 01:11:08,179 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 01:11:08,179 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 01:11:08,179 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 01:11:08,180 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 01:11:08,180 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 01:11:08,180 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 01:11:08,180 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 01:11:08,180 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 01:11:08,181 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 01:11:08,182 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 01:11:08,183 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 01:11:08,183 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 01:11:08,183 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 01:11:08,183 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 01:11:08,183 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 01:11:08,184 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 01:11:08,185 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 01:11:08,185 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 01:11:08,185 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 01:11:08,186 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 01:11:08,186 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 01:11:08,186 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 01:11:08,186 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 01:11:08,187 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 01:11:08,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 01:11:08,188 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 01:11:08,188 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 01:11:08,188 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 01:11:08,189 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 01:11:08,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 01:11:08,189 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 01:11:08,190 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 01:11:08,190 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 01:11:08,448 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 01:11:08,468 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 01:11:08,472 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 01:11:08,474 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 01:11:08,474 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 01:11:08,475 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--regulator--isl6271a-regulator.ko-main.cil.out.i [2019-11-24 01:11:08,549 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c668bce5/721ec25cf2e94482bdc469c48d65e919/FLAG47d7ea229 [2019-11-24 01:11:09,251 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 01:11:09,252 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2019-11-24 01:11:09,283 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c668bce5/721ec25cf2e94482bdc469c48d65e919/FLAG47d7ea229 [2019-11-24 01:11:09,459 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c668bce5/721ec25cf2e94482bdc469c48d65e919 [2019-11-24 01:11:09,468 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 01:11:09,470 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 01:11:09,471 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 01:11:09,471 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 01:11:09,474 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 01:11:09,475 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:11:09" (1/1) ... [2019-11-24 01:11:09,478 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@711581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:09, skipping insertion in model container [2019-11-24 01:11:09,478 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:11:09" (1/1) ... [2019-11-24 01:11:09,486 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 01:11:09,573 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 01:11:10,408 WARN L612 FunctionHandler]: implicit declaration of function ldv_malloc [2019-11-24 01:11:10,417 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 01:11:10,445 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 01:11:10,571 WARN L612 FunctionHandler]: implicit declaration of function ldv_malloc [2019-11-24 01:11:10,575 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 01:11:10,651 INFO L208 MainTranslator]: Completed translation [2019-11-24 01:11:10,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:10 WrapperNode [2019-11-24 01:11:10,652 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 01:11:10,653 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 01:11:10,653 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 01:11:10,654 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 01:11:10,663 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:11:10" (1/1) ... [2019-11-24 01:11:10,699 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:11:10" (1/1) ... [2019-11-24 01:11:10,790 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 01:11:10,790 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 01:11:10,791 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 01:11:10,791 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 01:11:10,803 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:10" (1/1) ... [2019-11-24 01:11:10,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:10" (1/1) ... [2019-11-24 01:11:10,835 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:10" (1/1) ... [2019-11-24 01:11:10,836 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:10" (1/1) ... [2019-11-24 01:11:10,886 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:10" (1/1) ... [2019-11-24 01:11:10,896 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:10" (1/1) ... [2019-11-24 01:11:10,907 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:10" (1/1) ... [2019-11-24 01:11:10,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 01:11:10,924 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 01:11:10,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 01:11:10,927 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 01:11:10,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:10" (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:11:11,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-24 01:11:11,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 01:11:11,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-24 01:11:11,037 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-24 01:11:11,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-24 01:11:11,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-24 01:11:11,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-24 01:11:11,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 01:11:11,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 01:11:11,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 01:11:13,859 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 01:11:13,860 INFO L284 CfgBuilder]: Removed 108 assume(true) statements. [2019-11-24 01:11:13,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:11:13 BoogieIcfgContainer [2019-11-24 01:11:13,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 01:11:13,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 01:11:13,866 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 01:11:13,869 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 01:11:13,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:11:09" (1/3) ... [2019-11-24 01:11:13,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c976ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:11:13, skipping insertion in model container [2019-11-24 01:11:13,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:10" (2/3) ... [2019-11-24 01:11:13,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c976ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:11:13, skipping insertion in model container [2019-11-24 01:11:13,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:11:13" (3/3) ... [2019-11-24 01:11:13,876 INFO L109 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2019-11-24 01:11:13,888 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 01:11:13,902 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-11-24 01:11:13,917 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-11-24 01:11:13,951 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 01:11:13,952 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 01:11:13,952 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 01:11:13,952 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 01:11:13,952 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 01:11:13,952 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 01:11:13,953 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 01:11:13,953 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 01:11:13,974 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2019-11-24 01:11:13,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-24 01:11:13,984 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:11:13,986 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:11:13,986 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:11:13,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:11:13,994 INFO L82 PathProgramCache]: Analyzing trace with hash 635098477, now seen corresponding path program 1 times [2019-11-24 01:11:14,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:11:14,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686874498] [2019-11-24 01:11:14,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:11:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:11:14,415 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:11:14,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686874498] [2019-11-24 01:11:14,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:11:14,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 01:11:14,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151532674] [2019-11-24 01:11:14,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:11:14,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:11:14,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:11:14,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:11:14,443 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 3 states. [2019-11-24 01:11:14,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:11:14,532 INFO L93 Difference]: Finished difference Result 166 states and 264 transitions. [2019-11-24 01:11:14,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:11:14,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-24 01:11:14,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:11:14,554 INFO L225 Difference]: With dead ends: 166 [2019-11-24 01:11:14,555 INFO L226 Difference]: Without dead ends: 104 [2019-11-24 01:11:14,565 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:11:14,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-24 01:11:14,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 96. [2019-11-24 01:11:14,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-24 01:11:14,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 149 transitions. [2019-11-24 01:11:14,648 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 149 transitions. Word has length 9 [2019-11-24 01:11:14,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:11:14,649 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 149 transitions. [2019-11-24 01:11:14,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:11:14,649 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 149 transitions. [2019-11-24 01:11:14,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-24 01:11:14,651 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:11:14,651 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:11:14,651 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:11:14,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:11:14,652 INFO L82 PathProgramCache]: Analyzing trace with hash 467760851, now seen corresponding path program 1 times [2019-11-24 01:11:14,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:11:14,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084216051] [2019-11-24 01:11:14,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:11:14,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:11:14,784 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:11:14,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084216051] [2019-11-24 01:11:14,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:11:14,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 01:11:14,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373667027] [2019-11-24 01:11:14,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:11:14,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:11:14,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:11:14,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:11:14,790 INFO L87 Difference]: Start difference. First operand 96 states and 149 transitions. Second operand 3 states. [2019-11-24 01:11:14,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:11:14,813 INFO L93 Difference]: Finished difference Result 96 states and 149 transitions. [2019-11-24 01:11:14,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:11:14,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-24 01:11:14,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:11:14,816 INFO L225 Difference]: With dead ends: 96 [2019-11-24 01:11:14,816 INFO L226 Difference]: Without dead ends: 94 [2019-11-24 01:11:14,818 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:11:14,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-24 01:11:14,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-11-24 01:11:14,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-24 01:11:14,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 147 transitions. [2019-11-24 01:11:14,842 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 147 transitions. Word has length 11 [2019-11-24 01:11:14,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:11:14,843 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 147 transitions. [2019-11-24 01:11:14,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:11:14,844 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 147 transitions. [2019-11-24 01:11:14,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-24 01:11:14,845 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:11:14,845 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:11:14,846 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:11:14,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:11:14,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1615683233, now seen corresponding path program 1 times [2019-11-24 01:11:14,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:11:14,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133726965] [2019-11-24 01:11:14,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:11:14,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:11:15,004 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:11:15,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133726965] [2019-11-24 01:11:15,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:11:15,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 01:11:15,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649934565] [2019-11-24 01:11:15,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:11:15,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:11:15,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:11:15,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:11:15,009 INFO L87 Difference]: Start difference. First operand 94 states and 147 transitions. Second operand 3 states. [2019-11-24 01:11:15,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:11:15,019 INFO L93 Difference]: Finished difference Result 94 states and 147 transitions. [2019-11-24 01:11:15,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:11:15,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-24 01:11:15,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:11:15,021 INFO L225 Difference]: With dead ends: 94 [2019-11-24 01:11:15,021 INFO L226 Difference]: Without dead ends: 92 [2019-11-24 01:11:15,022 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:11:15,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-24 01:11:15,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-11-24 01:11:15,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-24 01:11:15,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 145 transitions. [2019-11-24 01:11:15,031 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 145 transitions. Word has length 12 [2019-11-24 01:11:15,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:11:15,032 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 145 transitions. [2019-11-24 01:11:15,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:11:15,032 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 145 transitions. [2019-11-24 01:11:15,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-24 01:11:15,033 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:11:15,033 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:11:15,034 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:11:15,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:11:15,034 INFO L82 PathProgramCache]: Analyzing trace with hash 657253368, now seen corresponding path program 1 times [2019-11-24 01:11:15,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:11:15,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055686397] [2019-11-24 01:11:15,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:11:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:11:15,090 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:11:15,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055686397] [2019-11-24 01:11:15,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:11:15,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 01:11:15,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862177842] [2019-11-24 01:11:15,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:11:15,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:11:15,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:11:15,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:11:15,092 INFO L87 Difference]: Start difference. First operand 92 states and 145 transitions. Second operand 3 states. [2019-11-24 01:11:15,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:11:15,133 INFO L93 Difference]: Finished difference Result 200 states and 315 transitions. [2019-11-24 01:11:15,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:11:15,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-24 01:11:15,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:11:15,135 INFO L225 Difference]: With dead ends: 200 [2019-11-24 01:11:15,135 INFO L226 Difference]: Without dead ends: 109 [2019-11-24 01:11:15,136 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:11:15,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-24 01:11:15,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 101. [2019-11-24 01:11:15,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-24 01:11:15,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 162 transitions. [2019-11-24 01:11:15,153 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 162 transitions. Word has length 12 [2019-11-24 01:11:15,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:11:15,153 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 162 transitions. [2019-11-24 01:11:15,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:11:15,154 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 162 transitions. [2019-11-24 01:11:15,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 01:11:15,155 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:11:15,155 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:11:15,155 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:11:15,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:11:15,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1453428579, now seen corresponding path program 1 times [2019-11-24 01:11:15,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:11:15,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579302013] [2019-11-24 01:11:15,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:11:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:11:15,247 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:11:15,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579302013] [2019-11-24 01:11:15,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:11:15,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 01:11:15,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744733457] [2019-11-24 01:11:15,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:11:15,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:11:15,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:11:15,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:11:15,249 INFO L87 Difference]: Start difference. First operand 101 states and 162 transitions. Second operand 3 states. [2019-11-24 01:11:15,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:11:15,285 INFO L93 Difference]: Finished difference Result 101 states and 162 transitions. [2019-11-24 01:11:15,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:11:15,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-24 01:11:15,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:11:15,287 INFO L225 Difference]: With dead ends: 101 [2019-11-24 01:11:15,287 INFO L226 Difference]: Without dead ends: 95 [2019-11-24 01:11:15,287 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:11:15,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-24 01:11:15,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-11-24 01:11:15,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-24 01:11:15,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 156 transitions. [2019-11-24 01:11:15,297 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 156 transitions. Word has length 13 [2019-11-24 01:11:15,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:11:15,297 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 156 transitions. [2019-11-24 01:11:15,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:11:15,297 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 156 transitions. [2019-11-24 01:11:15,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-24 01:11:15,298 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:11:15,298 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:11:15,299 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:11:15,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:11:15,299 INFO L82 PathProgramCache]: Analyzing trace with hash -2106614229, now seen corresponding path program 1 times [2019-11-24 01:11:15,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:11:15,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91603677] [2019-11-24 01:11:15,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:11:15,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:11:15,362 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:11:15,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91603677] [2019-11-24 01:11:15,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:11:15,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 01:11:15,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970745107] [2019-11-24 01:11:15,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:11:15,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:11:15,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:11:15,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:11:15,365 INFO L87 Difference]: Start difference. First operand 95 states and 156 transitions. Second operand 3 states. [2019-11-24 01:11:15,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:11:15,372 INFO L93 Difference]: Finished difference Result 95 states and 156 transitions. [2019-11-24 01:11:15,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:11:15,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-24 01:11:15,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:11:15,373 INFO L225 Difference]: With dead ends: 95 [2019-11-24 01:11:15,374 INFO L226 Difference]: Without dead ends: 89 [2019-11-24 01:11:15,374 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:11:15,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-24 01:11:15,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-11-24 01:11:15,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-24 01:11:15,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 148 transitions. [2019-11-24 01:11:15,398 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 148 transitions. Word has length 14 [2019-11-24 01:11:15,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:11:15,398 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 148 transitions. [2019-11-24 01:11:15,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:11:15,399 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 148 transitions. [2019-11-24 01:11:15,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 01:11:15,405 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:11:15,405 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:11:15,406 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:11:15,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:11:15,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1759532179, now seen corresponding path program 1 times [2019-11-24 01:11:15,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:11:15,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264454852] [2019-11-24 01:11:15,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:11:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:11:15,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-24 01:11:15,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264454852] [2019-11-24 01:11:15,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:11:15,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 01:11:15,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555884505] [2019-11-24 01:11:15,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:11:15,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:11:15,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:11:15,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:11:15,503 INFO L87 Difference]: Start difference. First operand 89 states and 148 transitions. Second operand 3 states. [2019-11-24 01:11:15,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:11:15,563 INFO L93 Difference]: Finished difference Result 89 states and 148 transitions. [2019-11-24 01:11:15,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:11:15,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-24 01:11:15,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:11:15,564 INFO L225 Difference]: With dead ends: 89 [2019-11-24 01:11:15,564 INFO L226 Difference]: Without dead ends: 0 [2019-11-24 01:11:15,565 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:11:15,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-24 01:11:15,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-24 01:11:15,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-24 01:11:15,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-24 01:11:15,566 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-11-24 01:11:15,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:11:15,567 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-24 01:11:15,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:11:15,567 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-24 01:11:15,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-24 01:11:15,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-24 01:11:16,052 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 2676) no Hoare annotation was computed. [2019-11-24 01:11:16,053 INFO L444 ceAbstractionStarter]: For program point L2480(line 2480) no Hoare annotation was computed. [2019-11-24 01:11:16,053 INFO L440 ceAbstractionStarter]: At program point L2513(line 2513) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-24 01:11:16,053 INFO L444 ceAbstractionStarter]: For program point L2447(lines 2447 2474) no Hoare annotation was computed. [2019-11-24 01:11:16,053 INFO L444 ceAbstractionStarter]: For program point L2514(lines 2514 2550) no Hoare annotation was computed. [2019-11-24 01:11:16,053 INFO L440 ceAbstractionStarter]: At program point L2481(lines 2481 2486) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-24 01:11:16,053 INFO L440 ceAbstractionStarter]: At program point L2316(lines 2316 2319) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-24 01:11:16,053 INFO L444 ceAbstractionStarter]: For program point L2450(line 2450) no Hoare annotation was computed. [2019-11-24 01:11:16,053 INFO L440 ceAbstractionStarter]: At program point L2517(line 2517) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-24 01:11:16,054 INFO L440 ceAbstractionStarter]: At program point L2451(lines 2451 2459) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-24 01:11:16,054 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 2676) no Hoare annotation was computed. [2019-11-24 01:11:16,054 INFO L444 ceAbstractionStarter]: For program point L2488(line 2488) no Hoare annotation was computed. [2019-11-24 01:11:16,054 INFO L440 ceAbstractionStarter]: At program point L2356(lines 2299 2365) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-24 01:11:16,055 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 2676) no Hoare annotation was computed. [2019-11-24 01:11:16,055 INFO L440 ceAbstractionStarter]: At program point L2489(lines 2489 2504) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-24 01:11:16,055 INFO L440 ceAbstractionStarter]: At program point L2358(lines 2358 2362) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-24 01:11:16,055 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 2676) no Hoare annotation was computed. [2019-11-24 01:11:16,056 INFO L440 ceAbstractionStarter]: At program point L2524(line 2524) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-24 01:11:16,056 INFO L444 ceAbstractionStarter]: For program point L2491-2(lines 2489 2503) no Hoare annotation was computed. [2019-11-24 01:11:16,056 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 2676) no Hoare annotation was computed. [2019-11-24 01:11:16,056 INFO L444 ceAbstractionStarter]: For program point L2461(line 2461) no Hoare annotation was computed. [2019-11-24 01:11:16,056 INFO L440 ceAbstractionStarter]: At program point L2462(lines 2462 2467) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-24 01:11:16,056 INFO L440 ceAbstractionStarter]: At program point L2364(lines 2288 2366) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-24 01:11:16,057 INFO L444 ceAbstractionStarter]: For program point L2992(lines 2992 2995) no Hoare annotation was computed. [2019-11-24 01:11:16,057 INFO L444 ceAbstractionStarter]: For program point L2992-2(lines 2992 2995) no Hoare annotation was computed. [2019-11-24 01:11:16,057 INFO L447 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-24 01:11:16,057 INFO L444 ceAbstractionStarter]: For program point L2531(line 2531) no Hoare annotation was computed. [2019-11-24 01:11:16,057 INFO L440 ceAbstractionStarter]: At program point L2532(lines 2532 2536) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-24 01:11:16,057 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 2676) no Hoare annotation was computed. [2019-11-24 01:11:16,057 INFO L440 ceAbstractionStarter]: At program point L2500(lines 3115 3118) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-24 01:11:16,058 INFO L440 ceAbstractionStarter]: At program point L2335(lines 2335 2341) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-24 01:11:16,058 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-24 01:11:16,058 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 2676) no Hoare annotation was computed. [2019-11-24 01:11:16,058 INFO L444 ceAbstractionStarter]: For program point L2934(lines 2934 2937) no Hoare annotation was computed. [2019-11-24 01:11:16,058 INFO L444 ceAbstractionStarter]: For program point L2934-2(lines 2934 2937) no Hoare annotation was computed. [2019-11-24 01:11:16,058 INFO L444 ceAbstractionStarter]: For program point L2538(line 2538) no Hoare annotation was computed. [2019-11-24 01:11:16,058 INFO L440 ceAbstractionStarter]: At program point L2539(lines 2539 2543) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-24 01:11:16,059 INFO L440 ceAbstractionStarter]: At program point L2573(lines 2436 2578) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-24 01:11:16,059 INFO L440 ceAbstractionStarter]: At program point L2673-1(lines 1 3196) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 2) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 01:11:16,059 INFO L440 ceAbstractionStarter]: At program point L2673(lines 1 3196) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-24 01:11:16,059 INFO L440 ceAbstractionStarter]: At program point L2673-3(lines 1 3196) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 2) (= 1 ~ldv_mutex_mutex_of_device~0)) [2019-11-24 01:11:16,059 INFO L440 ceAbstractionStarter]: At program point L2673-2(lines 1 3196) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-24 01:11:16,059 INFO L444 ceAbstractionStarter]: For program point L2673-5(lines 3123 3126) no Hoare annotation was computed. [2019-11-24 01:11:16,059 INFO L444 ceAbstractionStarter]: For program point L2673-4(lines 3119 3122) no Hoare annotation was computed. [2019-11-24 01:11:16,060 INFO L447 ceAbstractionStarter]: At program point L2673-7(lines 3112 3133) the Hoare annotation is: true [2019-11-24 01:11:16,060 INFO L444 ceAbstractionStarter]: For program point L2673-6(lines 3127 3130) no Hoare annotation was computed. [2019-11-24 01:11:16,060 INFO L440 ceAbstractionStarter]: At program point L2310(lines 2310 2313) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-24 01:11:16,060 INFO L440 ceAbstractionStarter]: At program point L2343(lines 2299 2365) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-24 01:11:16,060 INFO L444 ceAbstractionStarter]: For program point L2476(line 2476) no Hoare annotation was computed. [2019-11-24 01:11:16,060 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2676) no Hoare annotation was computed. [2019-11-24 01:11:16,061 INFO L444 ceAbstractionStarter]: For program point L2477(lines 2477 2511) no Hoare annotation was computed. [2019-11-24 01:11:16,061 INFO L444 ceAbstractionStarter]: For program point L2676(line 2676) no Hoare annotation was computed. [2019-11-24 01:11:16,061 INFO L444 ceAbstractionStarter]: For program point L2676-2(line 2676) no Hoare annotation was computed. [2019-11-24 01:11:16,061 INFO L444 ceAbstractionStarter]: For program point L2676-1(line 2676) no Hoare annotation was computed. [2019-11-24 01:11:16,061 INFO L444 ceAbstractionStarter]: For program point L2676-4(line 2676) no Hoare annotation was computed. [2019-11-24 01:11:16,061 INFO L444 ceAbstractionStarter]: For program point L2676-3(line 2676) no Hoare annotation was computed. [2019-11-24 01:11:16,061 INFO L444 ceAbstractionStarter]: For program point L2676-6(line 2676) no Hoare annotation was computed. [2019-11-24 01:11:16,061 INFO L444 ceAbstractionStarter]: For program point L2676-5(line 2676) no Hoare annotation was computed. [2019-11-24 01:11:16,062 INFO L444 ceAbstractionStarter]: For program point L2676-7(line 2676) no Hoare annotation was computed. [2019-11-24 01:11:16,062 INFO L440 ceAbstractionStarter]: At program point L2379(lines 2371 2387) the Hoare annotation is: (and (= 1 ~ldv_mutex_lock~0) (= 1 ~ldv_mutex_cred_guard_mutex_of_signal_struct~0) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2019-11-24 01:11:16,062 INFO L444 ceAbstractionStarter]: For program point L2446(line 2446) no Hoare annotation was computed. [2019-11-24 01:11:16,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 01:11:16 BoogieIcfgContainer [2019-11-24 01:11:16,083 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-24 01:11:16,086 INFO L168 Benchmark]: Toolchain (without parser) took 6615.50 ms. Allocated memory was 138.9 MB in the beginning and 299.9 MB in the end (delta: 161.0 MB). Free memory was 97.4 MB in the beginning and 248.1 MB in the end (delta: -150.7 MB). Peak memory consumption was 134.4 MB. Max. memory is 7.1 GB. [2019-11-24 01:11:16,087 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 138.9 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-24 01:11:16,088 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1182.12 ms. Allocated memory was 138.9 MB in the beginning and 205.0 MB in the end (delta: 66.1 MB). Free memory was 97.2 MB in the beginning and 129.5 MB in the end (delta: -32.3 MB). Peak memory consumption was 39.0 MB. Max. memory is 7.1 GB. [2019-11-24 01:11:16,089 INFO L168 Benchmark]: Boogie Procedure Inliner took 136.97 ms. Allocated memory is still 205.0 MB. Free memory was 129.5 MB in the beginning and 123.4 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 7.1 GB. [2019-11-24 01:11:16,089 INFO L168 Benchmark]: Boogie Preprocessor took 133.57 ms. Allocated memory is still 205.0 MB. Free memory was 123.4 MB in the beginning and 117.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 7.1 GB. [2019-11-24 01:11:16,090 INFO L168 Benchmark]: RCFGBuilder took 2939.16 ms. Allocated memory was 205.0 MB in the beginning and 254.8 MB in the end (delta: 49.8 MB). Free memory was 117.9 MB in the beginning and 139.1 MB in the end (delta: -21.2 MB). Peak memory consumption was 78.9 MB. Max. memory is 7.1 GB. [2019-11-24 01:11:16,091 INFO L168 Benchmark]: TraceAbstraction took 2217.28 ms. Allocated memory was 254.8 MB in the beginning and 299.9 MB in the end (delta: 45.1 MB). Free memory was 139.1 MB in the beginning and 248.1 MB in the end (delta: -109.0 MB). Peak memory consumption was 60.3 MB. Max. memory is 7.1 GB. [2019-11-24 01:11:16,096 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 138.9 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1182.12 ms. Allocated memory was 138.9 MB in the beginning and 205.0 MB in the end (delta: 66.1 MB). Free memory was 97.2 MB in the beginning and 129.5 MB in the end (delta: -32.3 MB). Peak memory consumption was 39.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 136.97 ms. Allocated memory is still 205.0 MB. Free memory was 129.5 MB in the beginning and 123.4 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 133.57 ms. Allocated memory is still 205.0 MB. Free memory was 123.4 MB in the beginning and 117.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2939.16 ms. Allocated memory was 205.0 MB in the beginning and 254.8 MB in the end (delta: 49.8 MB). Free memory was 117.9 MB in the beginning and 139.1 MB in the end (delta: -21.2 MB). Peak memory consumption was 78.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2217.28 ms. Allocated memory was 254.8 MB in the beginning and 299.9 MB in the end (delta: 45.1 MB). Free memory was 139.1 MB in the beginning and 248.1 MB in the end (delta: -109.0 MB). Peak memory consumption was 60.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2676]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2676]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2676]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2676]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2676]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2676]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2676]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2676]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_mtx_of_isl_pmic == 2) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 2532]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 2539]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 2358]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 2316]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 3112]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2517]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 2481]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 2288]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && ldv_mutex_mtx_of_isl_pmic == 2) && 1 == ldv_mutex_mutex_of_device - InvariantResult [Line: 2489]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 3115]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 2436]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 2371]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 2335]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 2451]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 2462]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 2299]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2299]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 2310]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 2513]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - InvariantResult [Line: 2524]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_lock && 1 == ldv_mutex_cred_guard_mutex_of_signal_struct) && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_mtx_of_isl_pmic == 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 61 locations, 8 error locations. Result: SAFE, OverallTime: 2.1s, OverallIterations: 7, TraceHistogramMax: 2, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 542 SDtfs, 368 SDslu, 205 SDs, 0 SdLazy, 40 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 16 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 25 PreInvPairs, 77 NumberOfFragments, 301 HoareAnnotationTreeSize, 25 FomulaSimplifications, 516 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 25 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 93 NumberOfCodeBlocks, 93 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 2384 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 3/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...