/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-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 00:58:09,044 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 00:58:09,047 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 00:58:09,067 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 00:58:09,067 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 00:58:09,069 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 00:58:09,071 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 00:58:09,083 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 00:58:09,085 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 00:58:09,086 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 00:58:09,089 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 00:58:09,091 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 00:58:09,091 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 00:58:09,094 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 00:58:09,097 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 00:58:09,099 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 00:58:09,100 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 00:58:09,103 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 00:58:09,104 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 00:58:09,109 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 00:58:09,114 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 00:58:09,115 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 00:58:09,116 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 00:58:09,117 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 00:58:09,120 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 00:58:09,120 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 00:58:09,120 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 00:58:09,122 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 00:58:09,125 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 00:58:09,126 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 00:58:09,126 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 00:58:09,127 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 00:58:09,127 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 00:58:09,128 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 00:58:09,129 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 00:58:09,130 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 00:58:09,130 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 00:58:09,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 00:58:09,131 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 00:58:09,134 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 00:58:09,136 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 00:58:09,137 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 00:58:09,154 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 00:58:09,154 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 00:58:09,155 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 00:58:09,155 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 00:58:09,155 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 00:58:09,156 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 00:58:09,156 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 00:58:09,156 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 00:58:09,156 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 00:58:09,156 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 00:58:09,157 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 00:58:09,157 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 00:58:09,157 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 00:58:09,157 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 00:58:09,158 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 00:58:09,158 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 00:58:09,158 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 00:58:09,159 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 00:58:09,159 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 00:58:09,159 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 00:58:09,159 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 00:58:09,159 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 00:58:09,160 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 00:58:09,160 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 00:58:09,160 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 00:58:09,160 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 00:58:09,160 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 00:58:09,161 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 00:58:09,161 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 00:58:09,161 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 00:58:09,161 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 00:58:09,162 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 00:58:09,163 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 00:58:09,163 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 00:58:09,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 00:58:09,164 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 00:58:09,164 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 00:58:09,164 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 00:58:09,446 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 00:58:09,460 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 00:58:09,464 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 00:58:09,466 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 00:58:09,466 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 00:58:09,467 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2019-11-24 00:58:09,543 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/800aaea04/b44ec322985445099f626dba6f0f9243/FLAGa9471e561 [2019-11-24 00:58:10,347 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 00:58:10,348 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2019-11-24 00:58:10,379 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/800aaea04/b44ec322985445099f626dba6f0f9243/FLAGa9471e561 [2019-11-24 00:58:10,397 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/800aaea04/b44ec322985445099f626dba6f0f9243 [2019-11-24 00:58:10,410 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 00:58:10,413 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 00:58:10,414 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 00:58:10,414 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 00:58:10,417 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 00:58:10,418 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:58:10" (1/1) ... [2019-11-24 00:58:10,422 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@169e0042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:58:10, skipping insertion in model container [2019-11-24 00:58:10,423 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:58:10" (1/1) ... [2019-11-24 00:58:10,431 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 00:58:10,560 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 00:58:12,302 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 00:58:12,335 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 00:58:12,646 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 00:58:12,951 INFO L208 MainTranslator]: Completed translation [2019-11-24 00:58:12,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:58:12 WrapperNode [2019-11-24 00:58:12,952 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 00:58:12,953 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 00:58:12,953 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 00:58:12,953 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 00:58:12,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:58:12" (1/1) ... [2019-11-24 00:58:13,071 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:58:12" (1/1) ... [2019-11-24 00:58:13,343 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 00:58:13,344 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 00:58:13,344 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 00:58:13,344 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 00:58:13,355 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:58:12" (1/1) ... [2019-11-24 00:58:13,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:58:12" (1/1) ... [2019-11-24 00:58:13,401 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:58:12" (1/1) ... [2019-11-24 00:58:13,402 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:58:12" (1/1) ... [2019-11-24 00:58:13,531 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:58:12" (1/1) ... [2019-11-24 00:58:13,567 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:58:12" (1/1) ... [2019-11-24 00:58:13,593 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:58:12" (1/1) ... [2019-11-24 00:58:13,622 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 00:58:13,622 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 00:58:13,623 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 00:58:13,623 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 00:58:13,624 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:58:12" (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 00:58:13,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-11-24 00:58:13,686 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2019-11-24 00:58:13,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-24 00:58:13,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-24 00:58:13,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-24 00:58:13,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-24 00:58:13,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-24 00:58:13,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-24 00:58:13,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 00:58:13,688 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2019-11-24 00:58:13,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-24 00:58:13,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-24 00:58:13,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-24 00:58:13,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 00:58:13,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-11-24 00:58:13,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 00:58:13,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 00:58:42,160 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 00:58:42,160 INFO L284 CfgBuilder]: Removed 942 assume(true) statements. [2019-11-24 00:58:42,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:58:42 BoogieIcfgContainer [2019-11-24 00:58:42,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 00:58:42,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 00:58:42,163 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 00:58:42,166 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 00:58:42,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:58:10" (1/3) ... [2019-11-24 00:58:42,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ac06b43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:58:42, skipping insertion in model container [2019-11-24 00:58:42,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:58:12" (2/3) ... [2019-11-24 00:58:42,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ac06b43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:58:42, skipping insertion in model container [2019-11-24 00:58:42,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:58:42" (3/3) ... [2019-11-24 00:58:42,169 INFO L109 eAbstractionObserver]: Analyzing ICFG m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2019-11-24 00:58:42,179 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 00:58:42,188 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-24 00:58:42,199 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-24 00:58:42,225 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 00:58:42,225 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 00:58:42,225 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 00:58:42,225 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 00:58:42,225 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 00:58:42,225 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 00:58:42,225 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 00:58:42,225 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 00:58:42,244 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2019-11-24 00:58:42,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 00:58:42,252 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:58:42,252 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:58:42,253 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:58:42,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:58:42,258 INFO L82 PathProgramCache]: Analyzing trace with hash 263280660, now seen corresponding path program 1 times [2019-11-24 00:58:42,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:58:42,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204574699] [2019-11-24 00:58:42,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:58:42,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:58:42,797 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 00:58:42,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204574699] [2019-11-24 00:58:42,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:58:42,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 00:58:42,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232862684] [2019-11-24 00:58:42,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 00:58:42,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:58:42,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 00:58:42,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 00:58:42,822 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 4 states. [2019-11-24 00:58:43,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:58:43,051 INFO L93 Difference]: Finished difference Result 593 states and 1038 transitions. [2019-11-24 00:58:43,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 00:58:43,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-24 00:58:43,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:58:43,084 INFO L225 Difference]: With dead ends: 593 [2019-11-24 00:58:43,085 INFO L226 Difference]: Without dead ends: 376 [2019-11-24 00:58:43,090 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 00:58:43,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-11-24 00:58:43,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 191. [2019-11-24 00:58:43,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-11-24 00:58:43,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 328 transitions. [2019-11-24 00:58:43,171 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 328 transitions. Word has length 19 [2019-11-24 00:58:43,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:58:43,173 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 328 transitions. [2019-11-24 00:58:43,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 00:58:43,173 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 328 transitions. [2019-11-24 00:58:43,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 00:58:43,176 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:58:43,177 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:58:43,177 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:58:43,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:58:43,177 INFO L82 PathProgramCache]: Analyzing trace with hash 2034810220, now seen corresponding path program 1 times [2019-11-24 00:58:43,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:58:43,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182503320] [2019-11-24 00:58:43,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:58:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:58:43,354 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 00:58:43,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182503320] [2019-11-24 00:58:43,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:58:43,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 00:58:43,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279597875] [2019-11-24 00:58:43,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 00:58:43,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:58:43,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 00:58:43,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 00:58:43,358 INFO L87 Difference]: Start difference. First operand 191 states and 328 transitions. Second operand 5 states. [2019-11-24 00:58:43,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:58:43,591 INFO L93 Difference]: Finished difference Result 713 states and 1231 transitions. [2019-11-24 00:58:43,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 00:58:43,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-11-24 00:58:43,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:58:43,597 INFO L225 Difference]: With dead ends: 713 [2019-11-24 00:58:43,598 INFO L226 Difference]: Without dead ends: 711 [2019-11-24 00:58:43,602 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-24 00:58:43,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-11-24 00:58:43,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 192. [2019-11-24 00:58:43,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-24 00:58:43,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 329 transitions. [2019-11-24 00:58:43,640 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 329 transitions. Word has length 24 [2019-11-24 00:58:43,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:58:43,641 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 329 transitions. [2019-11-24 00:58:43,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 00:58:43,641 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 329 transitions. [2019-11-24 00:58:43,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 00:58:43,649 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:58:43,649 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:58:43,650 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:58:43,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:58:43,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1020375454, now seen corresponding path program 1 times [2019-11-24 00:58:43,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:58:43,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343014723] [2019-11-24 00:58:43,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:58:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:58:43,846 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 00:58:43,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343014723] [2019-11-24 00:58:43,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:58:43,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 00:58:43,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127786547] [2019-11-24 00:58:43,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 00:58:43,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:58:43,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 00:58:43,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 00:58:43,848 INFO L87 Difference]: Start difference. First operand 192 states and 329 transitions. Second operand 4 states. [2019-11-24 00:58:44,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:58:44,194 INFO L93 Difference]: Finished difference Result 382 states and 656 transitions. [2019-11-24 00:58:44,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 00:58:44,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-24 00:58:44,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:58:44,199 INFO L225 Difference]: With dead ends: 382 [2019-11-24 00:58:44,199 INFO L226 Difference]: Without dead ends: 192 [2019-11-24 00:58:44,200 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 00:58:44,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-24 00:58:44,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2019-11-24 00:58:44,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-24 00:58:44,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 328 transitions. [2019-11-24 00:58:44,211 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 328 transitions. Word has length 28 [2019-11-24 00:58:44,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:58:44,211 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 328 transitions. [2019-11-24 00:58:44,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 00:58:44,211 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 328 transitions. [2019-11-24 00:58:44,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-24 00:58:44,212 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:58:44,213 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:58:44,213 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:58:44,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:58:44,213 INFO L82 PathProgramCache]: Analyzing trace with hash -2054906600, now seen corresponding path program 1 times [2019-11-24 00:58:44,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:58:44,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327341785] [2019-11-24 00:58:44,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:58:44,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:58:44,360 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 00:58:44,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327341785] [2019-11-24 00:58:44,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:58:44,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 00:58:44,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623907053] [2019-11-24 00:58:44,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 00:58:44,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:58:44,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 00:58:44,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 00:58:44,362 INFO L87 Difference]: Start difference. First operand 192 states and 328 transitions. Second operand 4 states. [2019-11-24 00:58:46,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:58:46,889 INFO L93 Difference]: Finished difference Result 716 states and 1238 transitions. [2019-11-24 00:58:46,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 00:58:46,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-11-24 00:58:46,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:58:46,893 INFO L225 Difference]: With dead ends: 716 [2019-11-24 00:58:46,893 INFO L226 Difference]: Without dead ends: 526 [2019-11-24 00:58:46,895 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 00:58:46,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-11-24 00:58:46,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 194. [2019-11-24 00:58:46,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-24 00:58:46,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 330 transitions. [2019-11-24 00:58:46,912 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 330 transitions. Word has length 30 [2019-11-24 00:58:46,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:58:46,912 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 330 transitions. [2019-11-24 00:58:46,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 00:58:46,913 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 330 transitions. [2019-11-24 00:58:46,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-24 00:58:46,914 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:58:46,914 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:58:46,914 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:58:46,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:58:46,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1545564614, now seen corresponding path program 1 times [2019-11-24 00:58:46,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:58:46,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825677504] [2019-11-24 00:58:46,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:58:46,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:58:47,013 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 00:58:47,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825677504] [2019-11-24 00:58:47,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:58:47,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 00:58:47,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008295663] [2019-11-24 00:58:47,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 00:58:47,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:58:47,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 00:58:47,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 00:58:47,015 INFO L87 Difference]: Start difference. First operand 194 states and 330 transitions. Second operand 3 states. [2019-11-24 00:58:47,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:58:47,628 INFO L93 Difference]: Finished difference Result 558 states and 958 transitions. [2019-11-24 00:58:47,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 00:58:47,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-24 00:58:47,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:58:47,631 INFO L225 Difference]: With dead ends: 558 [2019-11-24 00:58:47,631 INFO L226 Difference]: Without dead ends: 366 [2019-11-24 00:58:47,632 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 00:58:47,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-11-24 00:58:47,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 195. [2019-11-24 00:58:47,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-11-24 00:58:47,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 331 transitions. [2019-11-24 00:58:47,649 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 331 transitions. Word has length 32 [2019-11-24 00:58:47,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:58:47,649 INFO L462 AbstractCegarLoop]: Abstraction has 195 states and 331 transitions. [2019-11-24 00:58:47,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 00:58:47,649 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 331 transitions. [2019-11-24 00:58:47,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-24 00:58:47,650 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:58:47,650 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:58:47,651 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:58:47,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:58:47,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1842247533, now seen corresponding path program 1 times [2019-11-24 00:58:47,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:58:47,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867263676] [2019-11-24 00:58:47,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:58:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:58:47,773 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 00:58:47,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867263676] [2019-11-24 00:58:47,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:58:47,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 00:58:47,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917335494] [2019-11-24 00:58:47,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 00:58:47,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:58:47,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 00:58:47,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 00:58:47,775 INFO L87 Difference]: Start difference. First operand 195 states and 331 transitions. Second operand 4 states. [2019-11-24 00:58:47,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:58:47,919 INFO L93 Difference]: Finished difference Result 581 states and 989 transitions. [2019-11-24 00:58:47,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 00:58:47,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-24 00:58:47,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:58:47,930 INFO L225 Difference]: With dead ends: 581 [2019-11-24 00:58:47,930 INFO L226 Difference]: Without dead ends: 388 [2019-11-24 00:58:47,931 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 00:58:47,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-11-24 00:58:47,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 196. [2019-11-24 00:58:47,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-11-24 00:58:47,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 332 transitions. [2019-11-24 00:58:47,961 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 332 transitions. Word has length 33 [2019-11-24 00:58:47,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:58:47,962 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 332 transitions. [2019-11-24 00:58:47,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 00:58:47,962 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 332 transitions. [2019-11-24 00:58:47,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-24 00:58:47,963 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:58:47,963 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:58:47,963 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:58:47,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:58:47,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1963018459, now seen corresponding path program 1 times [2019-11-24 00:58:47,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:58:47,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430550297] [2019-11-24 00:58:47,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:58:48,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:58:48,411 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 00:58:48,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430550297] [2019-11-24 00:58:48,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:58:48,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 00:58:48,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380578080] [2019-11-24 00:58:48,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 00:58:48,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:58:48,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 00:58:48,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 00:58:48,414 INFO L87 Difference]: Start difference. First operand 196 states and 332 transitions. Second operand 3 states. [2019-11-24 00:58:48,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:58:48,910 INFO L93 Difference]: Finished difference Result 564 states and 964 transitions. [2019-11-24 00:58:48,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 00:58:48,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-24 00:58:48,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:58:48,916 INFO L225 Difference]: With dead ends: 564 [2019-11-24 00:58:48,916 INFO L226 Difference]: Without dead ends: 370 [2019-11-24 00:58:48,917 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 00:58:48,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-11-24 00:58:48,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 196. [2019-11-24 00:58:48,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-11-24 00:58:48,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 331 transitions. [2019-11-24 00:58:48,939 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 331 transitions. Word has length 34 [2019-11-24 00:58:48,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:58:48,939 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 331 transitions. [2019-11-24 00:58:48,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 00:58:48,939 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 331 transitions. [2019-11-24 00:58:48,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-24 00:58:48,940 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:58:48,940 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:58:48,941 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:58:48,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:58:48,941 INFO L82 PathProgramCache]: Analyzing trace with hash 90370826, now seen corresponding path program 1 times [2019-11-24 00:58:48,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:58:48,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634024226] [2019-11-24 00:58:48,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:58:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-24 00:58:51,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-24 00:58:51,975 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-11-24 00:58:51,975 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-24 00:58:52,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 12:58:52 BoogieIcfgContainer [2019-11-24 00:58:52,256 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-24 00:58:52,263 INFO L168 Benchmark]: Toolchain (without parser) took 41845.55 ms. Allocated memory was 146.8 MB in the beginning and 1.0 GB in the end (delta: 877.7 MB). Free memory was 95.1 MB in the beginning and 861.4 MB in the end (delta: -766.3 MB). Peak memory consumption was 724.0 MB. Max. memory is 7.1 GB. [2019-11-24 00:58:52,264 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-11-24 00:58:52,265 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2538.32 ms. Allocated memory was 146.8 MB in the beginning and 253.8 MB in the end (delta: 107.0 MB). Free memory was 94.6 MB in the beginning and 188.4 MB in the end (delta: -93.7 MB). Peak memory consumption was 116.8 MB. Max. memory is 7.1 GB. [2019-11-24 00:58:52,268 INFO L168 Benchmark]: Boogie Procedure Inliner took 391.19 ms. Allocated memory is still 253.8 MB. Free memory was 188.4 MB in the beginning and 159.3 MB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. [2019-11-24 00:58:52,269 INFO L168 Benchmark]: Boogie Preprocessor took 278.11 ms. Allocated memory is still 253.8 MB. Free memory was 159.3 MB in the beginning and 130.4 MB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 7.1 GB. [2019-11-24 00:58:52,270 INFO L168 Benchmark]: RCFGBuilder took 28539.05 ms. Allocated memory was 253.8 MB in the beginning and 784.9 MB in the end (delta: 531.1 MB). Free memory was 130.4 MB in the beginning and 542.7 MB in the end (delta: -412.3 MB). Peak memory consumption was 548.3 MB. Max. memory is 7.1 GB. [2019-11-24 00:58:52,272 INFO L168 Benchmark]: TraceAbstraction took 10093.80 ms. Allocated memory was 784.9 MB in the beginning and 1.0 GB in the end (delta: 239.6 MB). Free memory was 542.7 MB in the beginning and 861.4 MB in the end (delta: -318.6 MB). Peak memory consumption was 533.6 MB. Max. memory is 7.1 GB. [2019-11-24 00:58:52,279 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.22 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2538.32 ms. Allocated memory was 146.8 MB in the beginning and 253.8 MB in the end (delta: 107.0 MB). Free memory was 94.6 MB in the beginning and 188.4 MB in the end (delta: -93.7 MB). Peak memory consumption was 116.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 391.19 ms. Allocated memory is still 253.8 MB. Free memory was 188.4 MB in the beginning and 159.3 MB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 278.11 ms. Allocated memory is still 253.8 MB. Free memory was 159.3 MB in the beginning and 130.4 MB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 28539.05 ms. Allocated memory was 253.8 MB in the beginning and 784.9 MB in the end (delta: 531.1 MB). Free memory was 130.4 MB in the beginning and 542.7 MB in the end (delta: -412.3 MB). Peak memory consumption was 548.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10093.80 ms. Allocated memory was 784.9 MB in the beginning and 1.0 GB in the end (delta: 239.6 MB). Free memory was 542.7 MB in the beginning and 861.4 MB in the end (delta: -318.6 MB). Peak memory consumption was 533.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 7115]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 4859, overapproximation of bitwiseAnd at line 4724. Possible FailurePath: [L5021] static int slip_maxdev = 256; [L6896] int LDV_IN_INTERRUPT ; [L5020] static struct net_device **slip_devs ; [L5836-L5839] static struct net_device_ops const sl_netdev_ops = {& sl_init, & sl_uninit, & sl_open, & sl_close, & sl_xmit, 0, 0, 0, 0, 0, 0, & sl_ioctl, 0, & sl_change_mtu, 0, & sl_tx_timeout, & sl_get_stats64, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}; [L6709-L6712] static struct tty_ldisc_ops sl_ldisc = {21507, (char *)"slip", 0, 0, & slip_open, & slip_close, 0, 0, 0, 0, & slip_ioctl, & slip_compat_ioctl, 0, 0, & slip_hangup, & slip_receive_buf, & slip_write_wakeup, 0, & __this_module, 0}; [L6899] struct net_device *var_group1 ; [L6900] int res_sl_init_14 ; [L6901] int res_sl_open_11 ; [L6902] int res_sl_close_10 ; [L6903] struct sk_buff *var_group2 ; [L6904] struct rtnl_link_stats64 *var_group3 ; [L6905] int var_sl_change_mtu_12_p1 ; [L6906] struct ifreq *var_group4 ; [L6907] int var_sl_ioctl_30_p2 ; [L6908] struct tty_struct *var_group5 ; [L6909] int res_slip_open_21 ; [L6910] struct file *var_group6 ; [L6911] unsigned int var_slip_ioctl_28_p2 ; [L6912] unsigned long var_slip_ioctl_28_p3 ; [L6913] unsigned int var_slip_compat_ioctl_29_p2 ; [L6914] unsigned long var_slip_compat_ioctl_29_p3 ; [L6915] unsigned char const *var_slip_receive_buf_18_p1 ; [L6916] char *var_slip_receive_buf_18_p2 ; [L6917] int var_slip_receive_buf_18_p3 ; [L6918] unsigned long var_sl_keepalive_34_p0 ; [L6919] unsigned long var_sl_outfill_33_p0 ; [L6920] int ldv_s_sl_netdev_ops_net_device_ops ; [L6921] int ldv_s_sl_ldisc_tty_ldisc_ops ; [L6922] int tmp ; [L6923] int tmp___0 ; [L6924] int tmp___1 ; [L6926] ldv_s_sl_netdev_ops_net_device_ops = 0 [L6927] ldv_s_sl_ldisc_tty_ldisc_ops = 0 [L6928] LDV_IN_INTERRUPT = 1 [L6715] int status ; [L6716] void *tmp ; [L6718] COND FALSE !(slip_maxdev <= 3) [L4857] void *tmp ; [L4848] void *tmp___2 ; [L4833] COND TRUE __VERIFIER_nondet_int() [L4834] void *res = malloc(size); [L4829] return ((unsigned long)ptr > ((unsigned long)-4095)); [L4836] return res; [L4843] return ldv_malloc(size); [L4850] tmp___2 = __kmalloc(size, flags) [L4851] return (tmp___2); [L4859] tmp = kmalloc(size, flags | 32768U) [L4860] return (tmp); [L6726] tmp = kzalloc((unsigned long )slip_maxdev * 8UL, 208U) [L6727] slip_devs = (struct net_device **)tmp [L6728] COND FALSE !((unsigned long )slip_devs == (unsigned long )((struct net_device **)0)) [L7273] return __VERIFIER_nondet_int(); [L6733] status = tty_register_ldisc(1, & sl_ldisc) [L6734] COND FALSE !(status != 0) [L6739] return (status); [L6931] tmp = slip_init() [L6932] COND FALSE !(tmp != 0) VAL [__this_module={4294967380:4294967377}, LDV_IN_INTERRUPT=1, sl_ldisc={166:0}, sl_netdev_ops={139:0}, slip_devs={-4095:0}, slip_maxdev=256] [L7062] tmp___1 = __VERIFIER_nondet_int() [L7063] COND TRUE (tmp___1 != 0 || ldv_s_sl_netdev_ops_net_device_ops != 0) || ldv_s_sl_ldisc_tty_ldisc_ops != 0 [L6938] tmp___0 = __VERIFIER_nondet_int() [L6940] case 0: [L6953] case 1: [L6966] case 2: [L6979] case 3: [L6987] case 4: [L6991] case 5: [L6995] case 6: [L6999] case 7: [L7003] case 8: [L7007] case 9: VAL [__this_module={4294967380:4294967377}, LDV_IN_INTERRUPT=1, sl_ldisc={166:0}, sl_netdev_ops={139:0}, slip_devs={-4095:0}, slip_maxdev=256] [L7008] COND TRUE ldv_s_sl_ldisc_tty_ldisc_ops == 0 [L7103] ldv_func_ret_type___1 ldv_func_res ; [L7104] int tmp ; [L6023] struct slip *sl ; [L6024] int err ; [L6025] int tmp ; [L6026] dev_t tmp___0 ; [L6027] struct task_struct *tmp___1 ; [L6028] int tmp___2 ; [L7158] return __VERIFIER_nondet_int(); [L6030] tmp = capable(12) [L6031] COND FALSE !(tmp == 0) [L6035] EXPR tty->ops [L6035] EXPR (tty->ops)->write VAL [__this_module={4294967380:4294967377}, LDV_IN_INTERRUPT=1, sl_ldisc={166:0}, sl_netdev_ops={139:0}, slip_devs={-4095:0}, slip_maxdev=256] [L6035-L6037] COND FALSE !((unsigned long )(tty->ops)->write == (unsigned long )((int (* )(struct tty_struct * , unsigned char const * , int ))0)) [L5911] int i ; [L5912] struct net_device *dev ; [L5913] struct slip *sl ; [L5914] void *tmp ; [L5916] i = 0 VAL [__this_module={4294967380:4294967377}, LDV_IN_INTERRUPT=1, sl_ldisc={166:0}, sl_netdev_ops={139:0}, slip_devs={-4095:0}, slip_maxdev=256] [L5937] COND TRUE i < slip_maxdev [L5919] EXPR slip_devs + (unsigned long )i [L5919] dev = *(slip_devs + (unsigned long )i) [L5920] COND TRUE (unsigned long )dev == (unsigned long )((struct net_device *)0) VAL [__this_module={4294967380:4294967377}, LDV_IN_INTERRUPT=1, sl_ldisc={166:0}, sl_netdev_ops={139:0}, slip_devs={-4095:0}, slip_maxdev=256] [L6043] EXPR tty->disc_data [L6043] sl = (struct slip *)tty->disc_data [L6044] err = -17 [L6045] (unsigned long )sl != (unsigned long )((struct slip *)0) && sl->magic == 21250 VAL [__this_module={4294967380:4294967377}, LDV_IN_INTERRUPT=1, sl_ldisc={166:0}, sl_netdev_ops={139:0}, slip_devs={-4095:0}, slip_maxdev=256] [L6045] COND FALSE !((unsigned long )sl != (unsigned long )((struct slip *)0) && sl->magic == 21250) [L6049] err = -23 [L7262] return __VERIFIER_nondet_uint(); [L6050] tmp___0 = tty_devnum(tty) [L5947] int i ; [L5948] struct net_device *dev ; [L5949] struct slip *sl ; [L5950] void *tmp ; [L5951] int tmp___0 ; [L5952] char name[16U] ; [L5953] void *tmp___1 ; [L5954] struct lock_class_key __key ; [L5955] struct lock_class_key __key___0 ; [L5956] struct lock_class_key __key___1 ; [L5958] dev = 0 VAL [__this_module={4294967380:4294967377}, LDV_IN_INTERRUPT=1, sl_ldisc={166:0}, sl_netdev_ops={139:0}, slip_devs={-4095:0}, slip_maxdev=256] [L5959] COND FALSE !((unsigned long )slip_devs == (unsigned long )((struct net_device **)0)) [L5963] i = 0 VAL [__this_module={4294967380:4294967377}, LDV_IN_INTERRUPT=1, sl_ldisc={166:0}, sl_netdev_ops={139:0}, slip_devs={-4095:0}, slip_maxdev=256] [L5973] COND TRUE i < slip_maxdev [L5966] EXPR slip_devs + (unsigned long )i [L5966] dev = *(slip_devs + (unsigned long )i) [L5967] COND TRUE (unsigned long )dev == (unsigned long )((struct net_device *)0) VAL [__this_module={4294967380:4294967377}, LDV_IN_INTERRUPT=1, sl_ldisc={166:0}, sl_netdev_ops={139:0}, slip_devs={-4095:0}, slip_maxdev=256] [L5978] COND FALSE !(i >= slip_maxdev) [L5982] COND FALSE !((unsigned long )dev != (unsigned long )((struct net_device *)0)) VAL [__this_module={4294967380:4294967377}, LDV_IN_INTERRUPT=1, sl_ldisc={166:0}, sl_netdev_ops={139:0}, slip_devs={-4095:0}, slip_maxdev=256] [L5994] COND TRUE (unsigned long )dev == (unsigned long )((struct net_device *)0) [L4833] COND TRUE __VERIFIER_nondet_int() [L4834] void *res = malloc(size); [L4829] return ((unsigned long)ptr > ((unsigned long)-4095)); [L4836] return res; [L7154] return ldv_malloc(sizeof(struct net_device)); [L5996] dev = alloc_netdev_mqs(472, (char const *)(& name), & sl_setup, 1U, 1U) [L5997] COND FALSE !((unsigned long )dev == (unsigned long )((struct net_device *)0)) [L6001] dev->base_addr = (unsigned long )i VAL [__this_module={4294967380:4294967377}, LDV_IN_INTERRUPT=1, sl_ldisc={166:0}, sl_netdev_ops={139:0}, slip_devs={-4095:0}, slip_maxdev=256] [L4889] return ((void *)dev + 2496U); [L6004] tmp___1 = netdev_priv((struct net_device const *)dev) [L6005] sl = (struct slip *)tmp___1 [L6006] sl->magic = 21250 [L6007] sl->dev = dev [L4767] return (& lock->ldv_5934.rlock); [L6010] sl->mode = 8U [L6012] sl->keepalive_timer.data = (unsigned long )sl [L6013] sl->keepalive_timer.function = & sl_keepalive [L6015] sl->outfill_timer.data = (unsigned long )sl [L6016] sl->outfill_timer.function = & sl_outfill [L6017] *(slip_devs + (unsigned long )i) = dev [L6018] return (sl); [L6018] return (sl); [L6018] return (sl); [L6018] return (sl); [L6018] return (sl); VAL [__this_module={4294967380:4294967377}, LDV_IN_INTERRUPT=1, sl_ldisc={166:0}, sl_netdev_ops={139:0}, slip_devs={-4095:0}, slip_maxdev=256] [L6051] sl = sl_alloc(tmp___0) [L6052] COND FALSE !((unsigned long )sl == (unsigned long )((struct slip *)0)) [L6056] sl->tty = tty [L6057] tty->disc_data = (void *)sl [L7262] return __VERIFIER_nondet_uint(); [L6058] sl->line = tty_devnum(tty) [L4735] struct task_struct *pfo_ret__ ; [L4738] case 1UL: [L4741] case 2UL: [L4744] case 4UL: [L4747] case 8UL: [L4754] return (pfo_ret__); [L6059] tmp___1 = get_current() [L6060] EXPR tmp___1->pid [L6060] sl->pid = tmp___1->pid [L4724] EXPR addr + (unsigned long )(nr / 64U) [L4724] return ((int )((unsigned long )*(addr + (unsigned long )(nr / 64U)) >> ((int )nr & 63)) & 1); [L6061] tmp___2 = constant_test_bit(0U, (unsigned long const volatile *)(& sl->flags)) [L6062] COND FALSE !(tmp___2 == 0) VAL [__this_module={4294967380:4294967377}, LDV_IN_INTERRUPT=1, sl_ldisc={166:0}, sl_netdev_ops={139:0}, slip_devs={-4095:0}, slip_maxdev=256] [L6076] EXPR sl->keepalive [L6076] COND FALSE !((unsigned int )sl->keepalive != 0U) [L6081] EXPR sl->outfill [L6081] COND TRUE (unsigned int )sl->outfill != 0U [L6082] EXPR sl->outfill [L6082] sl->outfill_timer.expires = (unsigned long )((int )sl->outfill * 250) + (unsigned long )jiffies [L6087] tty->receive_room = 65536U [L6088] EXPR sl->dev [L6088] EXPR (sl->dev)->base_addr [L6088] return ((int )(sl->dev)->base_addr); [L7106] tmp = slip_open(tty) [L7107] ldv_func_res = tmp [L7121] COND FALSE !(ret_val <= 0) VAL [__this_module={4294967380:4294967377}, jiffies=4294967293, LDV_IN_INTERRUPT=1, sl_ldisc={166:0}, sl_netdev_ops={139:0}, slip_devs={-4095:0}, slip_maxdev=256] [L7115] __VERIFIER_error() VAL [__this_module={4294967380:4294967377}, jiffies=4294967293, LDV_IN_INTERRUPT=1, sl_ldisc={166:0}, sl_netdev_ops={139:0}, slip_devs={-4095:0}, slip_maxdev=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 199 locations, 1 error locations. Result: UNSAFE, OverallTime: 10.0s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4389 SDtfs, 4590 SDslu, 4424 SDs, 0 SdLazy, 124 SolverSat, 8 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=199occurred in iteration=0, 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, 1573 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 235 NumberOfCodeBlocks, 235 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 193 ConstructedInterpolants, 0 QuantifiedInterpolants, 14370 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 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 could not prove your program: unable to determine feasibility of some traces Received shutdown request...