/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-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--arcnet--com90xx.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 01:19:23,323 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 01:19:23,325 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 01:19:23,337 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 01:19:23,338 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 01:19:23,339 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 01:19:23,340 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 01:19:23,342 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 01:19:23,344 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 01:19:23,345 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 01:19:23,346 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 01:19:23,347 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 01:19:23,347 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 01:19:23,348 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 01:19:23,351 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 01:19:23,353 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 01:19:23,355 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 01:19:23,356 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 01:19:23,360 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 01:19:23,363 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 01:19:23,367 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 01:19:23,369 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 01:19:23,372 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 01:19:23,372 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 01:19:23,374 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 01:19:23,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 01:19:23,377 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 01:19:23,379 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 01:19:23,381 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 01:19:23,382 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 01:19:23,382 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 01:19:23,384 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 01:19:23,385 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 01:19:23,386 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 01:19:23,388 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 01:19:23,388 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 01:19:23,389 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 01:19:23,389 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 01:19:23,389 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 01:19:23,393 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 01:19:23,394 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 01:19:23,395 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:19:23,416 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 01:19:23,416 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 01:19:23,417 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 01:19:23,418 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 01:19:23,418 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 01:19:23,418 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 01:19:23,418 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 01:19:23,418 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 01:19:23,418 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 01:19:23,419 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 01:19:23,420 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 01:19:23,420 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 01:19:23,420 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 01:19:23,421 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 01:19:23,421 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 01:19:23,422 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 01:19:23,422 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 01:19:23,423 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 01:19:23,423 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 01:19:23,423 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 01:19:23,423 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 01:19:23,423 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 01:19:23,423 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 01:19:23,424 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 01:19:23,424 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 01:19:23,424 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 01:19:23,424 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 01:19:23,424 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 01:19:23,425 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 01:19:23,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 01:19:23,426 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 01:19:23,426 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 01:19:23,426 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 01:19:23,427 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 01:19:23,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 01:19:23,427 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 01:19:23,427 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 01:19:23,428 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 01:19:23,706 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 01:19:23,719 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 01:19:23,723 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 01:19:23,724 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 01:19:23,724 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 01:19:23,725 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--arcnet--com90xx.ko-entry_point.cil.out.i [2019-11-24 01:19:23,813 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7117ae3f1/d8699cb78c304c17b350c3062be9f73a/FLAGb0eb73510 [2019-11-24 01:19:24,655 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 01:19:24,656 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--arcnet--com90xx.ko-entry_point.cil.out.i [2019-11-24 01:19:24,695 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7117ae3f1/d8699cb78c304c17b350c3062be9f73a/FLAGb0eb73510 [2019-11-24 01:19:24,719 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7117ae3f1/d8699cb78c304c17b350c3062be9f73a [2019-11-24 01:19:24,727 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 01:19:24,728 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 01:19:24,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 01:19:24,729 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 01:19:24,733 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 01:19:24,734 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:19:24" (1/1) ... [2019-11-24 01:19:24,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@843e590 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:19:24, skipping insertion in model container [2019-11-24 01:19:24,737 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:19:24" (1/1) ... [2019-11-24 01:19:24,745 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 01:19:24,853 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 01:19:26,274 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 01:19:26,301 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 01:19:26,691 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 01:19:26,775 INFO L208 MainTranslator]: Completed translation [2019-11-24 01:19:26,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:19:26 WrapperNode [2019-11-24 01:19:26,776 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 01:19:26,777 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 01:19:26,777 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 01:19:26,778 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 01:19:26,787 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:19:26" (1/1) ... [2019-11-24 01:19:26,855 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:19:26" (1/1) ... [2019-11-24 01:19:26,951 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 01:19:26,952 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 01:19:26,952 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 01:19:26,952 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 01:19:26,963 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:19:26" (1/1) ... [2019-11-24 01:19:26,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:19:26" (1/1) ... [2019-11-24 01:19:26,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:19:26" (1/1) ... [2019-11-24 01:19:26,975 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:19:26" (1/1) ... [2019-11-24 01:19:27,048 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:19:26" (1/1) ... [2019-11-24 01:19:27,079 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:19:26" (1/1) ... [2019-11-24 01:19:27,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:19:26" (1/1) ... [2019-11-24 01:19:27,120 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 01:19:27,121 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 01:19:27,121 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 01:19:27,121 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 01:19:27,123 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:19:26" (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:19:27,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-24 01:19:27,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-24 01:19:27,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-24 01:19:27,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-24 01:19:27,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 01:19:27,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-24 01:19:27,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-24 01:19:27,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-24 01:19:27,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 01:19:27,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 01:19:27,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 01:19:36,878 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 01:19:36,879 INFO L284 CfgBuilder]: Removed 297 assume(true) statements. [2019-11-24 01:19:36,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:19:36 BoogieIcfgContainer [2019-11-24 01:19:36,881 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 01:19:36,882 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 01:19:36,882 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 01:19:36,885 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 01:19:36,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:19:24" (1/3) ... [2019-11-24 01:19:36,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cb9d3df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:19:36, skipping insertion in model container [2019-11-24 01:19:36,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:19:26" (2/3) ... [2019-11-24 01:19:36,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cb9d3df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:19:36, skipping insertion in model container [2019-11-24 01:19:36,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:19:36" (3/3) ... [2019-11-24 01:19:36,889 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--arcnet--com90xx.ko-entry_point.cil.out.i [2019-11-24 01:19:36,899 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 01:19:36,907 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-24 01:19:36,919 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-24 01:19:36,946 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 01:19:36,946 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 01:19:36,946 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 01:19:36,946 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 01:19:36,946 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 01:19:36,947 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 01:19:36,947 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 01:19:36,947 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 01:19:36,967 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states. [2019-11-24 01:19:36,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-24 01:19:36,974 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:19:36,975 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:19:36,976 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:19:36,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:19:36,982 INFO L82 PathProgramCache]: Analyzing trace with hash -303463370, now seen corresponding path program 1 times [2019-11-24 01:19:36,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:19:36,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264889778] [2019-11-24 01:19:36,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:19:37,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:19:37,509 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:19:37,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264889778] [2019-11-24 01:19:37,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:19:37,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 01:19:37,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715192927] [2019-11-24 01:19:37,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:19:37,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:19:37,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:19:37,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:19:37,539 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 3 states. [2019-11-24 01:19:37,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:19:37,671 INFO L93 Difference]: Finished difference Result 290 states and 469 transitions. [2019-11-24 01:19:37,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:19:37,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-24 01:19:37,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:19:37,696 INFO L225 Difference]: With dead ends: 290 [2019-11-24 01:19:37,696 INFO L226 Difference]: Without dead ends: 153 [2019-11-24 01:19:37,700 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:19:37,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-24 01:19:37,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-11-24 01:19:37,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-24 01:19:37,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 235 transitions. [2019-11-24 01:19:37,760 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 235 transitions. Word has length 10 [2019-11-24 01:19:37,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:19:37,761 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 235 transitions. [2019-11-24 01:19:37,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:19:37,761 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 235 transitions. [2019-11-24 01:19:37,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 01:19:37,762 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:19:37,763 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:19:37,763 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:19:37,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:19:37,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1820446460, now seen corresponding path program 1 times [2019-11-24 01:19:37,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:19:37,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149150564] [2019-11-24 01:19:37,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:19:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:19:37,938 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:19:37,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149150564] [2019-11-24 01:19:37,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:19:37,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 01:19:37,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373803268] [2019-11-24 01:19:37,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:19:37,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:19:37,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:19:37,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:19:37,942 INFO L87 Difference]: Start difference. First operand 153 states and 235 transitions. Second operand 3 states. [2019-11-24 01:19:37,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:19:37,963 INFO L93 Difference]: Finished difference Result 265 states and 408 transitions. [2019-11-24 01:19:37,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:19:37,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-24 01:19:37,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:19:37,972 INFO L225 Difference]: With dead ends: 265 [2019-11-24 01:19:37,972 INFO L226 Difference]: Without dead ends: 153 [2019-11-24 01:19:37,974 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:19:37,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-24 01:19:37,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-11-24 01:19:37,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-24 01:19:37,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 234 transitions. [2019-11-24 01:19:38,000 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 234 transitions. Word has length 16 [2019-11-24 01:19:38,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:19:38,000 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 234 transitions. [2019-11-24 01:19:38,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:19:38,000 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 234 transitions. [2019-11-24 01:19:38,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 01:19:38,001 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:19:38,001 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:19:38,002 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:19:38,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:19:38,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1276227736, now seen corresponding path program 1 times [2019-11-24 01:19:38,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:19:38,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647623690] [2019-11-24 01:19:38,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:19:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:19:38,317 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:19:38,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647623690] [2019-11-24 01:19:38,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:19:38,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 01:19:38,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766414087] [2019-11-24 01:19:38,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:19:38,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:19:38,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:19:38,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:19:38,320 INFO L87 Difference]: Start difference. First operand 153 states and 234 transitions. Second operand 3 states. [2019-11-24 01:19:38,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:19:38,336 INFO L93 Difference]: Finished difference Result 267 states and 409 transitions. [2019-11-24 01:19:38,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:19:38,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-24 01:19:38,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:19:38,338 INFO L225 Difference]: With dead ends: 267 [2019-11-24 01:19:38,338 INFO L226 Difference]: Without dead ends: 155 [2019-11-24 01:19:38,339 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:19:38,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-24 01:19:38,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-11-24 01:19:38,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-24 01:19:38,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 236 transitions. [2019-11-24 01:19:38,351 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 236 transitions. Word has length 17 [2019-11-24 01:19:38,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:19:38,352 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 236 transitions. [2019-11-24 01:19:38,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:19:38,352 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 236 transitions. [2019-11-24 01:19:38,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 01:19:38,353 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:19:38,353 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:19:38,354 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:19:38,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:19:38,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1751591875, now seen corresponding path program 1 times [2019-11-24 01:19:38,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:19:38,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741530696] [2019-11-24 01:19:38,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:19:38,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:19:38,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 01:19:38,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741530696] [2019-11-24 01:19:38,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:19:38,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 01:19:38,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805063379] [2019-11-24 01:19:38,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:19:38,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:19:38,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:19:38,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:19:38,527 INFO L87 Difference]: Start difference. First operand 155 states and 236 transitions. Second operand 3 states. [2019-11-24 01:19:38,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:19:38,536 INFO L93 Difference]: Finished difference Result 155 states and 236 transitions. [2019-11-24 01:19:38,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:19:38,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-24 01:19:38,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:19:38,537 INFO L225 Difference]: With dead ends: 155 [2019-11-24 01:19:38,538 INFO L226 Difference]: Without dead ends: 153 [2019-11-24 01:19:38,538 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:19:38,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-24 01:19:38,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-11-24 01:19:38,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-24 01:19:38,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 234 transitions. [2019-11-24 01:19:38,550 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 234 transitions. Word has length 19 [2019-11-24 01:19:38,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:19:38,551 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 234 transitions. [2019-11-24 01:19:38,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:19:38,551 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 234 transitions. [2019-11-24 01:19:38,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 01:19:38,552 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:19:38,552 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:19:38,553 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:19:38,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:19:38,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1535226900, now seen corresponding path program 1 times [2019-11-24 01:19:38,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:19:38,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130100836] [2019-11-24 01:19:38,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:19:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:19:38,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 01:19:38,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130100836] [2019-11-24 01:19:38,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:19:38,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 01:19:38,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306297987] [2019-11-24 01:19:38,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:19:38,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:19:38,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:19:38,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:19:38,708 INFO L87 Difference]: Start difference. First operand 153 states and 234 transitions. Second operand 3 states. [2019-11-24 01:19:38,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:19:38,716 INFO L93 Difference]: Finished difference Result 153 states and 234 transitions. [2019-11-24 01:19:38,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:19:38,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-24 01:19:38,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:19:38,718 INFO L225 Difference]: With dead ends: 153 [2019-11-24 01:19:38,718 INFO L226 Difference]: Without dead ends: 151 [2019-11-24 01:19:38,719 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:19:38,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-24 01:19:38,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-11-24 01:19:38,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-24 01:19:38,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 232 transitions. [2019-11-24 01:19:38,729 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 232 transitions. Word has length 20 [2019-11-24 01:19:38,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:19:38,730 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 232 transitions. [2019-11-24 01:19:38,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:19:38,730 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 232 transitions. [2019-11-24 01:19:38,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 01:19:38,731 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:19:38,731 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:19:38,731 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:19:38,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:19:38,732 INFO L82 PathProgramCache]: Analyzing trace with hash -347393811, now seen corresponding path program 1 times [2019-11-24 01:19:38,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:19:38,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914839741] [2019-11-24 01:19:38,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:19:38,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:19:38,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 01:19:38,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914839741] [2019-11-24 01:19:38,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:19:38,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 01:19:38,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609123185] [2019-11-24 01:19:38,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:19:38,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:19:38,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:19:38,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:19:38,843 INFO L87 Difference]: Start difference. First operand 151 states and 232 transitions. Second operand 3 states. [2019-11-24 01:19:38,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:19:38,852 INFO L93 Difference]: Finished difference Result 151 states and 232 transitions. [2019-11-24 01:19:38,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:19:38,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-24 01:19:38,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:19:38,854 INFO L225 Difference]: With dead ends: 151 [2019-11-24 01:19:38,854 INFO L226 Difference]: Without dead ends: 149 [2019-11-24 01:19:38,855 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:19:38,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-24 01:19:38,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-11-24 01:19:38,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-24 01:19:38,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 230 transitions. [2019-11-24 01:19:38,865 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 230 transitions. Word has length 21 [2019-11-24 01:19:38,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:19:38,865 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 230 transitions. [2019-11-24 01:19:38,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:19:38,866 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 230 transitions. [2019-11-24 01:19:38,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 01:19:38,867 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:19:38,867 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:19:38,867 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:19:38,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:19:38,868 INFO L82 PathProgramCache]: Analyzing trace with hash 2115693590, now seen corresponding path program 1 times [2019-11-24 01:19:38,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:19:38,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436009239] [2019-11-24 01:19:38,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:19:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:19:38,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 01:19:38,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436009239] [2019-11-24 01:19:38,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:19:38,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 01:19:38,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414666276] [2019-11-24 01:19:38,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:19:38,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:19:38,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:19:38,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:19:38,975 INFO L87 Difference]: Start difference. First operand 149 states and 230 transitions. Second operand 3 states. [2019-11-24 01:19:38,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:19:38,984 INFO L93 Difference]: Finished difference Result 149 states and 230 transitions. [2019-11-24 01:19:38,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:19:38,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-24 01:19:38,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:19:38,986 INFO L225 Difference]: With dead ends: 149 [2019-11-24 01:19:38,986 INFO L226 Difference]: Without dead ends: 147 [2019-11-24 01:19:38,986 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:19:38,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-11-24 01:19:38,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-11-24 01:19:38,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-24 01:19:38,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 228 transitions. [2019-11-24 01:19:38,999 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 228 transitions. Word has length 22 [2019-11-24 01:19:38,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:19:38,999 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 228 transitions. [2019-11-24 01:19:38,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:19:38,999 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 228 transitions. [2019-11-24 01:19:39,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 01:19:39,005 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:19:39,005 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:19:39,005 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:19:39,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:19:39,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1161991703, now seen corresponding path program 1 times [2019-11-24 01:19:39,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:19:39,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370194308] [2019-11-24 01:19:39,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:19:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:19:39,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 01:19:39,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370194308] [2019-11-24 01:19:39,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:19:39,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 01:19:39,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903511423] [2019-11-24 01:19:39,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:19:39,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:19:39,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:19:39,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:19:39,123 INFO L87 Difference]: Start difference. First operand 147 states and 228 transitions. Second operand 3 states. [2019-11-24 01:19:39,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:19:39,130 INFO L93 Difference]: Finished difference Result 147 states and 228 transitions. [2019-11-24 01:19:39,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:19:39,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-24 01:19:39,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:19:39,131 INFO L225 Difference]: With dead ends: 147 [2019-11-24 01:19:39,131 INFO L226 Difference]: Without dead ends: 0 [2019-11-24 01:19:39,132 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:19:39,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-24 01:19:39,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-24 01:19:39,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-24 01:19:39,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-24 01:19:39,133 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-11-24 01:19:39,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:19:39,133 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-24 01:19:39,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:19:39,134 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-24 01:19:39,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-24 01:19:39,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-24 01:19:40,445 INFO L440 ceAbstractionStarter]: At program point L5783(lines 5783 5786) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,445 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 5159) no Hoare annotation was computed. [2019-11-24 01:19:40,445 INFO L440 ceAbstractionStarter]: At program point L6181(lines 6167 6187) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,446 INFO L440 ceAbstractionStarter]: At program point L5983(lines 5983 5990) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,446 INFO L440 ceAbstractionStarter]: At program point L5719(lines 5719 5739) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,446 INFO L440 ceAbstractionStarter]: At program point L5328(lines 5320 5333) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,446 INFO L440 ceAbstractionStarter]: At program point L5923(lines 5923 5932) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,447 INFO L440 ceAbstractionStarter]: At program point L5793(lines 5793 5814) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,447 INFO L440 ceAbstractionStarter]: At program point L5661(lines 5281 5872) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,447 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 5159) no Hoare annotation was computed. [2019-11-24 01:19:40,447 INFO L440 ceAbstractionStarter]: At program point L6653-1(lines 1 6684) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,447 INFO L444 ceAbstractionStarter]: For program point L5334-1(lines 5334 5351) no Hoare annotation was computed. [2019-11-24 01:19:40,448 INFO L444 ceAbstractionStarter]: For program point L6325(line 6325) no Hoare annotation was computed. [2019-11-24 01:19:40,448 INFO L444 ceAbstractionStarter]: For program point L6326(lines 6326 6329) no Hoare annotation was computed. [2019-11-24 01:19:40,448 INFO L440 ceAbstractionStarter]: At program point L5864(lines 5281 5872) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,448 INFO L440 ceAbstractionStarter]: At program point L5535(lines 5535 5550) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,448 INFO L440 ceAbstractionStarter]: At program point L5601(lines 5281 5872) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,448 INFO L444 ceAbstractionStarter]: For program point L6197-2(lines 6197 6214) no Hoare annotation was computed. [2019-11-24 01:19:40,448 INFO L440 ceAbstractionStarter]: At program point L6197-3(lines 6197 6214) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,448 INFO L444 ceAbstractionStarter]: For program point L6197(lines 6197 6214) no Hoare annotation was computed. [2019-11-24 01:19:40,448 INFO L440 ceAbstractionStarter]: At program point L6197-1(lines 6197 6214) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,449 INFO L444 ceAbstractionStarter]: For program point L6197-6(lines 6197 6214) no Hoare annotation was computed. [2019-11-24 01:19:40,449 INFO L440 ceAbstractionStarter]: At program point L6197-7(lines 6197 6214) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,449 INFO L444 ceAbstractionStarter]: For program point L6197-4(lines 6197 6214) no Hoare annotation was computed. [2019-11-24 01:19:40,449 INFO L440 ceAbstractionStarter]: At program point L6197-5(lines 6197 6214) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,449 INFO L444 ceAbstractionStarter]: For program point L6331(line 6331) no Hoare annotation was computed. [2019-11-24 01:19:40,449 INFO L440 ceAbstractionStarter]: At program point L6001(lines 6001 6008) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,450 INFO L444 ceAbstractionStarter]: For program point L6332(lines 6332 6363) no Hoare annotation was computed. [2019-11-24 01:19:40,450 INFO L444 ceAbstractionStarter]: For program point L6200-1(line 6200) no Hoare annotation was computed. [2019-11-24 01:19:40,450 INFO L444 ceAbstractionStarter]: For program point L6200-2(line 6200) no Hoare annotation was computed. [2019-11-24 01:19:40,450 INFO L444 ceAbstractionStarter]: For program point L6200(line 6200) no Hoare annotation was computed. [2019-11-24 01:19:40,450 INFO L444 ceAbstractionStarter]: For program point L6200-3(line 6200) no Hoare annotation was computed. [2019-11-24 01:19:40,450 INFO L440 ceAbstractionStarter]: At program point L5474(lines 5281 5872) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,451 INFO L440 ceAbstractionStarter]: At program point L6201-2(lines 6201 6207) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,451 INFO L440 ceAbstractionStarter]: At program point L6201-3(lines 6201 6207) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,451 INFO L440 ceAbstractionStarter]: At program point L6201(lines 6201 6207) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,451 INFO L440 ceAbstractionStarter]: At program point L6201-1(lines 6201 6207) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,451 INFO L440 ceAbstractionStarter]: At program point L5871(lines 6154 6157) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,451 INFO L440 ceAbstractionStarter]: At program point L5607(lines 5281 5872) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,452 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-24 01:19:40,452 INFO L444 ceAbstractionStarter]: For program point L6268(line 6268) no Hoare annotation was computed. [2019-11-24 01:19:40,452 INFO L440 ceAbstractionStarter]: At program point L5740-2(lines 5281 5872) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,452 INFO L440 ceAbstractionStarter]: At program point L5740(lines 5740 5769) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,452 INFO L444 ceAbstractionStarter]: For program point L6335(line 6335) no Hoare annotation was computed. [2019-11-24 01:19:40,452 INFO L444 ceAbstractionStarter]: For program point L6336(lines 6336 6341) no Hoare annotation was computed. [2019-11-24 01:19:40,453 INFO L440 ceAbstractionStarter]: At program point L5610(lines 5281 5872) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,453 INFO L440 ceAbstractionStarter]: At program point L5346(lines 5338 5351) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,453 INFO L444 ceAbstractionStarter]: For program point L6271(line 6271) no Hoare annotation was computed. [2019-11-24 01:19:40,453 INFO L444 ceAbstractionStarter]: For program point L6274(line 6274) no Hoare annotation was computed. [2019-11-24 01:19:40,453 INFO L440 ceAbstractionStarter]: At program point L5746(lines 5746 5766) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,453 INFO L444 ceAbstractionStarter]: For program point L6209-2(line 6209) no Hoare annotation was computed. [2019-11-24 01:19:40,454 INFO L444 ceAbstractionStarter]: For program point L6209-3(line 6209) no Hoare annotation was computed. [2019-11-24 01:19:40,454 INFO L444 ceAbstractionStarter]: For program point L6209(line 6209) no Hoare annotation was computed. [2019-11-24 01:19:40,454 INFO L444 ceAbstractionStarter]: For program point L6209-1(line 6209) no Hoare annotation was computed. [2019-11-24 01:19:40,454 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5159) no Hoare annotation was computed. [2019-11-24 01:19:40,454 INFO L444 ceAbstractionStarter]: For program point L5615-2(lines 5281 5872) no Hoare annotation was computed. [2019-11-24 01:19:40,455 INFO L440 ceAbstractionStarter]: At program point L5285-2(lines 5285 5292) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,455 INFO L444 ceAbstractionStarter]: For program point L5285-3(lines 5285 5292) no Hoare annotation was computed. [2019-11-24 01:19:40,455 INFO L444 ceAbstractionStarter]: For program point L6343(line 6343) no Hoare annotation was computed. [2019-11-24 01:19:40,455 INFO L444 ceAbstractionStarter]: For program point L5286(lines 5286 5289) no Hoare annotation was computed. [2019-11-24 01:19:40,455 INFO L444 ceAbstractionStarter]: For program point L6277(line 6277) no Hoare annotation was computed. [2019-11-24 01:19:40,455 INFO L444 ceAbstractionStarter]: For program point L6344(lines 6344 6356) no Hoare annotation was computed. [2019-11-24 01:19:40,455 INFO L444 ceAbstractionStarter]: For program point L5155(lines 6608 6611) no Hoare annotation was computed. [2019-11-24 01:19:40,456 INFO L444 ceAbstractionStarter]: For program point L5155-1(lines 6612 6615) no Hoare annotation was computed. [2019-11-24 01:19:40,456 INFO L447 ceAbstractionStarter]: At program point L5155-4(lines 6601 6626) the Hoare annotation is: true [2019-11-24 01:19:40,456 INFO L444 ceAbstractionStarter]: For program point L5155-2(lines 6616 6619) no Hoare annotation was computed. [2019-11-24 01:19:40,456 INFO L444 ceAbstractionStarter]: For program point L5155-3(lines 6620 6623) no Hoare annotation was computed. [2019-11-24 01:19:40,456 INFO L440 ceAbstractionStarter]: At program point L5816(lines 5281 5872) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,456 INFO L440 ceAbstractionStarter]: At program point L5552(lines 5552 5568) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,456 INFO L444 ceAbstractionStarter]: For program point L6346-2(lines 6344 6355) no Hoare annotation was computed. [2019-11-24 01:19:40,457 INFO L444 ceAbstractionStarter]: For program point L6280(line 6280) no Hoare annotation was computed. [2019-11-24 01:19:40,457 INFO L440 ceAbstractionStarter]: At program point L6215(lines 6192 6217) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,457 INFO L440 ceAbstractionStarter]: At program point L6215-1(lines 6192 6217) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,457 INFO L444 ceAbstractionStarter]: For program point L5158(line 5158) no Hoare annotation was computed. [2019-11-24 01:19:40,457 INFO L444 ceAbstractionStarter]: For program point L5158-3(line 5158) no Hoare annotation was computed. [2019-11-24 01:19:40,457 INFO L444 ceAbstractionStarter]: For program point L5158-4(line 5158) no Hoare annotation was computed. [2019-11-24 01:19:40,457 INFO L440 ceAbstractionStarter]: At program point L6215-2(lines 6192 6217) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,458 INFO L444 ceAbstractionStarter]: For program point L5158-1(line 5158) no Hoare annotation was computed. [2019-11-24 01:19:40,458 INFO L440 ceAbstractionStarter]: At program point L6215-3(lines 6192 6217) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,458 INFO L444 ceAbstractionStarter]: For program point L5158-2(line 5158) no Hoare annotation was computed. [2019-11-24 01:19:40,458 INFO L440 ceAbstractionStarter]: At program point L5490(lines 5490 5493) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,458 INFO L440 ceAbstractionStarter]: At program point L6019(lines 6019 6022) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,459 INFO L440 ceAbstractionStarter]: At program point L5953(lines 5920 6036) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,459 INFO L440 ceAbstractionStarter]: At program point L5821(lines 5281 5872) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,459 INFO L440 ceAbstractionStarter]: At program point L5293-2(lines 5293 5296) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,459 INFO L440 ceAbstractionStarter]: At program point L5955(lines 5955 5958) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,459 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 5159) no Hoare annotation was computed. [2019-11-24 01:19:40,460 INFO L440 ceAbstractionStarter]: At program point L6352(lines 6604 6607) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,460 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 5159) no Hoare annotation was computed. [2019-11-24 01:19:40,460 INFO L447 ceAbstractionStarter]: At program point L5165-2(lines 5164 5167) the Hoare annotation is: true [2019-11-24 01:19:40,460 INFO L447 ceAbstractionStarter]: At program point L5165-3(lines 5164 5167) the Hoare annotation is: true [2019-11-24 01:19:40,460 INFO L447 ceAbstractionStarter]: At program point L5165(lines 5164 5167) the Hoare annotation is: true [2019-11-24 01:19:40,460 INFO L447 ceAbstractionStarter]: At program point L5165-1(lines 5164 5167) the Hoare annotation is: true [2019-11-24 01:19:40,460 INFO L447 ceAbstractionStarter]: At program point L5165-6(lines 5164 5167) the Hoare annotation is: true [2019-11-24 01:19:40,461 INFO L447 ceAbstractionStarter]: At program point L5165-4(lines 5164 5167) the Hoare annotation is: true [2019-11-24 01:19:40,461 INFO L447 ceAbstractionStarter]: At program point L5165-5(lines 5164 5167) the Hoare annotation is: true [2019-11-24 01:19:40,461 INFO L440 ceAbstractionStarter]: At program point L5695(lines 5695 5715) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,461 INFO L440 ceAbstractionStarter]: At program point L5629(lines 5619 5637) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,461 INFO L440 ceAbstractionStarter]: At program point L5299(lines 5299 5302) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,461 INFO L444 ceAbstractionStarter]: For program point L6358(line 6358) no Hoare annotation was computed. [2019-11-24 01:19:40,461 INFO L440 ceAbstractionStarter]: At program point L5433(lines 5281 5872) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,462 INFO L440 ceAbstractionStarter]: At program point L6029(lines 5920 6036) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,462 INFO L440 ceAbstractionStarter]: At program point L5964(lines 5920 6036) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,462 INFO L440 ceAbstractionStarter]: At program point L6031(lines 5920 6036) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,462 INFO L447 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-24 01:19:40,462 INFO L444 ceAbstractionStarter]: For program point L5305(lines 5305 5309) no Hoare annotation was computed. [2019-11-24 01:19:40,462 INFO L440 ceAbstractionStarter]: At program point L5966(lines 5966 5969) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,463 INFO L444 ceAbstractionStarter]: For program point L5438-2(lines 5281 5872) no Hoare annotation was computed. [2019-11-24 01:19:40,463 INFO L440 ceAbstractionStarter]: At program point L6033(lines 5920 6036) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,463 INFO L444 ceAbstractionStarter]: For program point L5571(lines 5571 5582) no Hoare annotation was computed. [2019-11-24 01:19:40,463 INFO L440 ceAbstractionStarter]: At program point L6628-2(lines 1 6684) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,463 INFO L440 ceAbstractionStarter]: At program point L6628(lines 1 6684) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,463 INFO L444 ceAbstractionStarter]: For program point L6365(line 6365) no Hoare annotation was computed. [2019-11-24 01:19:40,464 INFO L440 ceAbstractionStarter]: At program point L6035(lines 5903 6037) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,464 INFO L440 ceAbstractionStarter]: At program point L6368(lines 6317 6373) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,464 INFO L440 ceAbstractionStarter]: At program point L5576-1(lines 5281 5872) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,464 INFO L444 ceAbstractionStarter]: For program point L5316-2(lines 5281 5872) no Hoare annotation was computed. [2019-11-24 01:19:40,464 INFO L444 ceAbstractionStarter]: For program point L5316(lines 5316 5333) no Hoare annotation was computed. [2019-11-24 01:19:40,464 INFO L440 ceAbstractionStarter]: At program point L5977(lines 5977 5980) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,465 INFO L440 ceAbstractionStarter]: At program point L5845(lines 5281 5872) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,465 INFO L440 ceAbstractionStarter]: At program point L5847(lines 5281 5872) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,465 INFO L440 ceAbstractionStarter]: At program point L5518(lines 5518 5533) the Hoare annotation is: (and (= ~dev_counter~0 0) (= ~usb_dev~0.base 0) (= 0 ~usb_urb~0.offset) (= ~SERIAL_STATE~0 0) (= ~com90xx_skip_probe~0 0) (= ~usb_urb~0.base 0) (= 0 ~usb_dev~0.offset) (= ~ldv_state_variable_0~0 1) (= 0 ~INTERF_STATE~0)) [2019-11-24 01:19:40,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 01:19:40 BoogieIcfgContainer [2019-11-24 01:19:40,516 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-24 01:19:40,521 INFO L168 Benchmark]: Toolchain (without parser) took 15789.36 ms. Allocated memory was 137.9 MB in the beginning and 489.7 MB in the end (delta: 351.8 MB). Free memory was 93.4 MB in the beginning and 347.3 MB in the end (delta: -254.0 MB). Peak memory consumption was 390.5 MB. Max. memory is 7.1 GB. [2019-11-24 01:19:40,522 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.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:19:40,523 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2047.65 ms. Allocated memory was 137.9 MB in the beginning and 226.0 MB in the end (delta: 88.1 MB). Free memory was 92.9 MB in the beginning and 117.1 MB in the end (delta: -24.2 MB). Peak memory consumption was 71.2 MB. Max. memory is 7.1 GB. [2019-11-24 01:19:40,524 INFO L168 Benchmark]: Boogie Procedure Inliner took 174.23 ms. Allocated memory is still 226.0 MB. Free memory was 117.1 MB in the beginning and 105.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 7.1 GB. [2019-11-24 01:19:40,526 INFO L168 Benchmark]: Boogie Preprocessor took 168.81 ms. Allocated memory is still 226.0 MB. Free memory was 105.1 MB in the beginning and 94.2 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2019-11-24 01:19:40,527 INFO L168 Benchmark]: RCFGBuilder took 9760.41 ms. Allocated memory was 226.0 MB in the beginning and 406.3 MB in the end (delta: 180.4 MB). Free memory was 94.2 MB in the beginning and 149.1 MB in the end (delta: -54.9 MB). Peak memory consumption was 217.9 MB. Max. memory is 7.1 GB. [2019-11-24 01:19:40,528 INFO L168 Benchmark]: TraceAbstraction took 3633.66 ms. Allocated memory was 406.3 MB in the beginning and 489.7 MB in the end (delta: 83.4 MB). Free memory was 149.1 MB in the beginning and 347.3 MB in the end (delta: -198.2 MB). Peak memory consumption was 177.8 MB. Max. memory is 7.1 GB. [2019-11-24 01:19:40,539 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.29 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2047.65 ms. Allocated memory was 137.9 MB in the beginning and 226.0 MB in the end (delta: 88.1 MB). Free memory was 92.9 MB in the beginning and 117.1 MB in the end (delta: -24.2 MB). Peak memory consumption was 71.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 174.23 ms. Allocated memory is still 226.0 MB. Free memory was 117.1 MB in the beginning and 105.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 168.81 ms. Allocated memory is still 226.0 MB. Free memory was 105.1 MB in the beginning and 94.2 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 9760.41 ms. Allocated memory was 226.0 MB in the beginning and 406.3 MB in the end (delta: 180.4 MB). Free memory was 94.2 MB in the beginning and 149.1 MB in the end (delta: -54.9 MB). Peak memory consumption was 217.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3633.66 ms. Allocated memory was 406.3 MB in the beginning and 489.7 MB in the end (delta: 83.4 MB). Free memory was 149.1 MB in the beginning and 347.3 MB in the end (delta: -198.2 MB). Peak memory consumption was 177.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5159]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5159]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5159]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5159]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5159]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 5281]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 5719]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 5920]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 5338]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 5281]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 5920]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 5518]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 6019]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 6001]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 5281]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 6604]: Loop Invariant Derived loop invariant: ((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 5299]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 5320]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 5285]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 5983]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 5281]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 5793]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 5281]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 5164]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5490]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 5746]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 5164]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5619]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6167]: Loop Invariant Derived loop invariant: ((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 5164]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5920]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 5552]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 5903]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 5783]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 5164]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5281]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 6317]: Loop Invariant Derived loop invariant: ((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 6192]: Loop Invariant Derived loop invariant: ((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 5164]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 5695]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 5977]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 6197]: Loop Invariant Derived loop invariant: ((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 5281]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 5966]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 5955]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 5293]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 5164]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5164]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 6192]: Loop Invariant Derived loop invariant: ((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 5281]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 6197]: Loop Invariant Derived loop invariant: ((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 6192]: Loop Invariant Derived loop invariant: ((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 6197]: Loop Invariant Derived loop invariant: ((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 6154]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 6197]: Loop Invariant Derived loop invariant: ((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 6192]: Loop Invariant Derived loop invariant: ((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 6201]: Loop Invariant Derived loop invariant: ((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 5923]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 5281]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 5535]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 6201]: Loop Invariant Derived loop invariant: ((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 6601]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5281]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 6201]: Loop Invariant Derived loop invariant: ((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 5920]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 5281]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 6201]: Loop Invariant Derived loop invariant: ((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && 0 == INTERF_STATE - InvariantResult [Line: 5740]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 5281]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 5920]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - InvariantResult [Line: 5281]: Loop Invariant Derived loop invariant: (((((((dev_counter == 0 && usb_dev == 0) && 0 == usb_urb) && SERIAL_STATE == 0) && com90xx_skip_probe == 0) && usb_urb == 0) && 0 == usb_dev) && ldv_state_variable_0 == 1) && 0 == INTERF_STATE - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 122 locations, 5 error locations. Result: SAFE, OverallTime: 3.5s, OverallIterations: 8, TraceHistogramMax: 2, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, HoareTripleCheckerStatistics: 1361 SDtfs, 1067 SDslu, 260 SDs, 0 SdLazy, 20 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=3, 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, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 70 LocationsWithAnnotation, 70 PreInvPairs, 160 NumberOfFragments, 1672 HoareAnnotationTreeSize, 70 FomulaSimplifications, 409 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 70 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 148 NumberOfCodeBlocks, 148 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 9486 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 10/10 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...